Theory and application of satisfiability testing--SAT 2011 : 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011 : proceedings / Karem A. Sakallah, Laurent Simon (eds.).

By:

SAT 2011 (2011 : Ann Arbor, Mich.)

Contributor(s):

Material type: Text

TextSeries: Lecture notes in computer science ; 6695. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publication details: Berlin : Springer, 2011.Description: 1 online resource (xii, 380 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642215810
3642215815
3642215807
9783642215803

Other title:

SAT 2011

Subject(s): Genre/Form:

Additional physical formats: Print version:: Theory and application of satisfiability testing - SAT 2011.DDC classification:

005.1 23

LOC classification:

QA76.9.A43 S28 2011

Online resources:

Click here to access online

Summary: 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.

Holdings ( 1 )
Title notes ( 3 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
eBook	e-Library	eBook LNCS		Available

Total holds: 0

Includes bibliographical references and author index.

Print version record.

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.