Recommendations
Cites work
- 2 -Way vs.d -Way Branching for CSP
- A Computing Procedure for Quantification Theory
- A hierarchy of tractable satisfiability problems
- A machine program for theorem-proving
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- Effective Incorporation of Double Look-Ahead Procedures
- scientific article; zbMATH DE number 1002950 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Investigations on autark assignments
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Mapping CSP into Many-Valued SAT
- New methods for 3-SAT decision and worst-case analysis
- On a generalization of extended resolution
- On the use of autarkies for satisfiability decision
- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
- Search Problems in the Decision Tree Model
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- Solving satisfiability in less than \(2^ n\) steps
- Solving Satisfiability with Less Searching
- The Complexity of Propositional Proofs
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and applications of satisfiability testing -- SAT 2007. 10th international conference, Lisbon, Portugal, May 28--31, 2007. Proceedings
- Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5--8, 2003. Selected revised papers
- Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers.
- Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
- Whose side are you on? Finding solutions in a biased search-tree
Cited in
(19)- On tackling the limits of resolution in SAT solving
- Generalising unit-refutation completeness and SLUR via nested input resolution
- SAT and SMT are still resolution: questions and challenges
- Inprocessing rules
- Generalising and unifying SLUR and unit-refutation completeness
- Empirical study of the anatomy of modern SAT solvers
- Propositional SAT solving
- A (biased) proof complexity survey for SAT practitioners
- Contrasat -- a contrarian SAT solver
- scientific article; zbMATH DE number 5139172 (Why is no real title available?)
- scientific article; zbMATH DE number 27687 (Why is no real title available?)
- Anatomy and empirical evaluation of modern SAT solvers
- SAT solving with reference points
- Automated Verification of Signalling Principles in Railway Interlocking Systems
- Theory and Applications of Satisfiability Testing
- Applying modern SAT-solvers to solving hard problems
- Theory and Applications of Satisfiability Testing
- Diversifying a parallel SAT solver with Bayesian moment matching
- Formalization and implementation of modern SAT solvers
This page was built for publication: Present and Future of Practical SAT Solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504707)
