SAT 2005
Publication year: 2006
ISBN: 978-1-4020-5571-3
Internet Resource: Please Login to download book
This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia mathematica".
Subject: Computer Science, Automat, Extension, Principia Mathematica, algorithms, artificial intelligence, automated deduction, classification, complexity, complexity theory, intelligence, logic, software verification, verification
