Theory and Applications of Satisfiability Testing - SAT 2011 [recurso electrónico] : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings / edited by Karem A. Sakallah, Laurent Simon.
Tipo de material:
TextoSeries Lecture Notes in Computer Science ; 6695Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: XIII, 371p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642215810Tema(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 DesignFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1015113 Clasificación LoC:QA76.9.L63QA76.5913QA76.63Recursos en línea: Libro electrónico
En: Springer eBooksResumen: 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.
| Tipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
|---|---|---|---|---|---|---|---|
| Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | QA76.9 .L63 (Browse shelf(Abre debajo)) | 1 | No para préstamo | 376311-2001 |
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.
19
