SAT 2005
Satisfiability Research in the Year 2005
Please note that the standard 14-day cancellation right terminates upon receiving access to the e-book.
Product description
This book covers recent progress 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. This book follows on from the highly successful volume entitled SAT 2000 published five years ago.
Accessibility information
Select variation, to see accessibility information
Details
- ISBN13 9781402055713
- Released 2007
- Publisher Springer
- Format Elektronisk medie
- Edition 1
- Language English