Autarky pruning in propositional model elimination reduces failure redundancy
From MaRDI portal
Publication:1808886
DOI10.1023/A:1006143621319zbMath0939.68108OpenAlexW1592629506MaRDI QIDQ1808886
Publication date: 25 November 1999
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006143621319
Related Items
Minimal sets on propositional formulae. Problems and reductions, A Decision-Making Procedure for Resolution-Based SAT-Solvers, Subsumption-linear Q-resolution for QBF theorem proving, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Complexity analysis of propositional resolution with autarky pruning, An overview of parallel SAT solving, Another look at graph coloring via propositional satisfiability, Investigations on autark assignments
Uses Software
