Theory and Applications of Satisfiability Testing - SAT 2011 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings / [electronic resource] : edited by Karem A. Sakallah, Laurent Simon. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. - XIII, 371p. online resource. - Lecture Notes in Computer Science, 6695 0302-9743 ; . - Lecture Notes in Computer Science, 6695 .

This book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011. The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.

9783642215810

10.1007/978-3-642-21581-0 doi


Computer science.
Logic design.
Computer software.
Artificial intelligence.
Computer Science.
Logics and Meanings of Programs.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Artificial Intelligence (incl. Robotics).
Logic Design.

QA76.9.L63 QA76.5913 QA76.63

005.1015113
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha