Introduction to Mathematics of Satisfiability
DOI10.1201/9781439801741zbMath1184.68001MaRDI QIDQ3399426
Publication date: 12 October 2009
Full work available at URL: https://doi.org/10.1201/9781439801741
normal forms; propositional logic; compactness; NP-completeness; resolution; satisfiability; SAT; fixpoint theorem; DPLL; clausal logic; Craig lemma
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations
03B70: Logic in computer science
03B35: Mechanization of proofs and logical operations
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
03B05: Classical propositional logic
Related Items