Back to Results
First PageMeta Content
Theoretical computer science / Mathematical logic / Automated theorem proving / Mathematics / Logic in computer science / Propositional calculus / Constraint programming / DPLL algorithm / Logic programming / Boolean satisfiability problem / Unsatisfiable core / Maximum satisfiability problem


Efficient Generation of Unsatisfiability Proofs and Cores in SAT Roberto As´ın, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. Some modern DPLL-based propositional SAT solvers now have fas
Add to Reading List

Document Date: 2008-09-01 09:50:28


Open Document

File Size: 200,27 KB

Share Result on Facebook