Pages that link to "Item:Q1606302"
From MaRDI portal
The following pages link to Algorithms for selective enumeration of prime implicants (Q1606302):
Displaying 14 items.
- Preferences and explanations (Q814503) (← links)
- Polynomial-time algorithms for generation of prime implicants (Q1190532) (← links)
- An efficient algorithm to generate prime implicants (Q1283201) (← links)
- CNF and DNF considered harmful for computing prime implicants/implicates (Q1367074) (← links)
- An SE-tree-based prime implicant generation algorithm (Q1924815) (← links)
- Fuzzy relational equations with min-biimplication composition (Q1927264) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- Computing prime implicates by pruning the search space and accelerating subsumption (Q3133151) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- (Q3698700) (← links)
- (Q4140891) (← links)
- (Q4870090) (← links)
- A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function (Q5557458) (← links)
- On prime scenarios in qualitative spatial and temporal reasoning (Q6614889) (← links)