Theory and Applications of Satisfiability Testing - SAT 2011 [electronic resource] : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings / edited by Karem A. Sakallah, Laurent Simon.
Material type:
TextSeries: Lecture Notes in Computer Science ; 6695Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XIII, 371p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642215810Subject(s): 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 DesignAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK9683 |
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.
There are no comments on this title.