• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
SAT 2005: Satisfiability Research in the Year 2005

SAT 2005: Satisfiability Research in the Year 2005

Hardcover

General ComputersProgramming

ISBN10: 1402045522
ISBN13: 9781402045523
Publisher: Springer Nature
Published: Oct 30 2006
Pages: 293
Weight: 1.35
Height: 0.70 Width: 6.20 Depth: 9.30
Language: English

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.

Also in

General Computers