Theory and applications of satisfiability testing - SAT 2010 : 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010 : proceedings / Ofer Strichman, Stefan Szeider (eds.).
Material type:
TextSeries: Lecture notes in computer science ; 6175.Publication details: New York : SpringerLink, 2010.Description: 1 online resource (xiii, 400 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783642141867
- 3642141862
- 9783642141850
- 3642141854
- SAT 2010
- Propositional calculus -- Congresses
- Decision making -- Congresses
- Computer algorithms -- Congresses
- Algebra, Boolean -- Congresses
- Mathematical Computing
- Algorithms
- Decision Making, Computer-Assisted
- Calcul propositionnel -- Congrès
- Prise de décision -- Congrès
- Algorithmes -- Congrès
- Algèbre de Boole -- Congrès
- Algorithmes
- algorithms
- Algebra, Boolean
- Computer algorithms
- Decision making
- Propositional calculus
- 511.3 22
- QA9.3
- QA 9.3
- 31.10
- 54.10
- 54.72
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
International conference proceedings.
With bibliographical references and index.
pt. 1. Invited talks -- pt. 2. Regular papers -- pt. 3. Short papers.
Annotation This book constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010. The 21 revised full papers presented together with 14 revised short papers and 2 invited talks were carefully selected from 75 submissions. The papers cover a broad range of topics such as proof systems and proof complexity; search algorithms and heuristics; analysis of algorithms; combinatorial theory of satisfiability; random instances vs structured instances; problem encodings; industrial applications; applications to combinatorics; solvers, simplifiers and tools; and exact and parameterized algorithms.