Beschreibung
Produktdetails
Einband
Gebundene Ausgabe
Erscheinungsdatum
September 2009
Verlag
Chapman And HallSeitenzahl
364
Maße (L/B/H)
24.4/16.4/2.9 cm
Gewicht
690 g
Sprache
Englisch
ISBN
978-1-4398-0167-3
This book focuses on the satisfiability of theories consisting of propositional logic formulas. It first deals with logic fundamentals, including the syntax of propositional logic, complete sets of functors, normal forms, the Craig lemma, and compactness. The book then examines clauses, their proof theory and semantics, and basic complexity issues of propositional logic. The final chapters on knowledge representation cover finite runs of Turing machines and encodings into SAT. The author also shows how constraint satisfaction systems can be worked out by satisfiability solvers and how answer set programming can be used for knowledge representation.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung