Cargando…

Theory and Application of Satisfiability Testing 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011, Proceedings /

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 caref...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Sakallah, Karem A. (Editor ), Simon, Laurent (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Theoretical Computer Science and General Issues, 6695
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-21581-0
003 DE-He213
005 20230406034443.0
007 cr nn 008mamaa
008 110610s2011 gw | s |||| 0|eng d
020 |a 9783642215810  |9 978-3-642-21581-0 
024 7 |a 10.1007/978-3-642-21581-0  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Theory and Application of Satisfiability Testing  |h [electronic resource] :  |b 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011, Proceedings /  |c edited by Karem A. Sakallah, Laurent Simon. 
250 |a 1st ed. 2011. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XIII, 371 p. 63 illus., 28 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6695 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Machine theory. 
650 0 |a Artificial intelligence. 
650 0 |a Logic design. 
650 1 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithms. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Logic Design. 
700 1 |a Sakallah, Karem A.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Simon, Laurent.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642215803 
776 0 8 |i Printed edition:  |z 9783642215827 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6695 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-21581-0  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)