Present and Future of Practical SAT Solving

DOI10.1007/978-3-540-92800-3_11zbMath1171.68500OpenAlexW1526397236MaRDI QIDQ5504707

Oliver Kullmann

Publication date: 22 January 2009

Published in: Complexity of Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92800-3_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Generalising and Unifying SLUR and Unit-Refutation Completeness ⋮ Automated Verification of Signalling Principles in Railway Interlocking Systems ⋮ Generalising unit-refutation completeness and SLUR via nested input resolution

Uses Software

• kcnfs
• March_eq
• MiniSat
• Zchaff2004

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving satisfiability in less than \(2^ n\) steps
• A hierarchy of tractable satisfiability problems
• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
• Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5--8, 2003. Selected revised papers
• Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
• Investigations on autark assignments
• New methods for 3-SAT decision and worst-case analysis
• On a generalization of extended resolution
• Theory and applications of satisfiability testing -- SAT 2007. 10th international conference, Lisbon, Portugal, May 28--31, 2007. Proceedings
• Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers.
• Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
• Solving Satisfiability with Less Searching
• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• 2 -Way vs.d -Way Branching for CSP
• Mapping CSP into Many-Valued SAT
• Effective Incorporation of Double Look-Ahead Procedures
• Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
• Search Problems in the Decision Tree Model
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• The Complexity of Propositional Proofs
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel

This page was built for publication: Present and Future of Practical SAT Solving