Pages that link to "Item:Q1808886"
From MaRDI portal
The following pages link to Autarky pruning in propositional model elimination reduces failure redundancy (Q1808886):
Displayed 8 items.
- An overview of parallel SAT solving (Q487635) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- Subsumption-linear Q-resolution for QBF theorem proving (Q6199591) (← links)