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.
- ISBN: 978-94-007-8715-5
- Editorial: Springer
- Encuadernacion: Rústica
- Fecha Publicación: 03/12/2014
- Nº Volúmenes: 1
- Idioma: Inglés