Clausal normal form

#	Item
1	MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2 Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:41:50 Mathematics Propositional calculus Unsatisfiable core Conjunctive normal form Resolution Logic programming First-order logic Logic Mathematical logic Automated theorem proving
2	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving
3	1997-Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-10 19:20:44 Automated theorem proving Boolean algebra Logic in computer science Logic programming Resolution Rewriting Clausal normal form Valuation Propositional calculus Logic Mathematical logic Mathematics