9. SAT 2006: Seattle, WA, USA
Armin Biere, Carla P. Gomes (Eds.): Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings. Springer 2006 Lecture Notes in Computer Science ISBN 3-540-37206-7
Invited Talks
- Hossein M. Sheini, Karem A. Sakallah: From Propositional Satisfiability to Satisfiability Modulo Theories. 1-9
- Fahiem Bacchus: CSPs: Adding Structure to SAT. 10-10
Proofs and Cores
- Arist Kojevnikov, Alexander S. Kulikov: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. 11-21
- Oliver Kullmann, Inês Lynce, João Marques-Silva: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. 22-35
- Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. 36-41
- Allen Van Gelder: Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. 48-53
- Toni Jussila, Carsten Sinz, Armin Biere: Extended Resolution Proofs for Symbolic SAT Solving with Quantification. 54-60
Heuristics and Algorithms
- Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke: Satisfiability Checking of Non-clausal Formulas Using General Matings. 75-89
- Eugene Goldberg: Determinization of Resolution by an Algorithm Operating on Complete Assignments. 90-95
- Hantao Zhang: A Complete Random Jump Strategy with Guiding Paths. 96-101
Applications
- Yuliya Zabiyaka, Adnan Darwiche: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. 116-129
- Roberto Sebastiani, Michele Vescovi: Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC. 130-135
- Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. 136-141
SMT
- Hossein M. Sheini, Karem A. Sakallah: A Progressive Simplifier for Satisfiability Modulo Theories. 184-197
Structure
- Su Chen, Tomasz Imielinski, Karin Johnsgard, Donald Smith, Mario Szegedy: A Dichotomy Theorem for Typed Constraint Satisfaction Problems. 226-239
MAX-SAT
- Evgeny Dantsin, Alexander Wolpert: MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. 266-276
Local Search and Survey Propagation
- Panagiotis Manolios, Yimin Zhang: Implementing Survey Propagation on Graphics Processing Units. 311-324
- Eric I. Hsu, Sheila A. McIlraith: Characterizing Propagation Methods for Boolean Satisfiability. 325-338
QBF
- Daijue Tang, Sharad Malik: Solving Quantified Boolean Formulas with Circuit Observability Don't Cares. 368-381
- Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. 382-395
Counting and Concurrency
- António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva: Counting Models in Integer Domains. 410-423
- Marc Thurley: sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. 424-429
- Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: A Distribution Method for Solving SAT in Grids. 430-435
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team