Unrestricted vs restricted cut in a tableau method for Boolean circuits
From MaRDI portal
Recommendations
- Towards an efficient tableau method for Boolean circuit satisfiability checking
- scientific article; zbMATH DE number 1552525
- Simplification: A general constraint propagation technique for propositional and modal tableaux
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- The complexity of analytic tableaux
Cites work
- A Computing Procedure for Quantification Theory
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- A machine program for theorem-proving
- A structure-preserving clause form translation
- Applying the Davis-Putnam procedure to non-clausal formulas
- Bounded model checking using satisfiability solving
- Extremal combinatorics. With applications in computer science
- Finding bugs in an alpha microprocessor using satisfiability solvers
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1179974 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- Simplification: A general constraint propagation technique for propositional and modal tableaux
- The efficiency of resolution and Davis-Putnam procedures
- The intractability of resolution
- The quest for efficient Boolean satisfiability solvers
- The Taming of the Cut. Classical Refutations with Analytic Cut
- Tuning SAT checkers for bounded model checking
Cited in
(7)- Limitations of restricted branching in clause learning
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Implementing preferences with asprin
- Limitations of Restricted Branching in Clause Learning
- On exponential lower bounds for partially ordered resolution
- A general framework for preferences in answer set programming
- Solving satisfiability problems with preferences
This page was built for publication: Unrestricted vs restricted cut in a tableau method for Boolean circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812394)