SATO: An efficient propositional prover
From MaRDI portal
Cites work
- A machine program for theorem-proving
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956858 (Why is no real title available?)
- scientific article; zbMATH DE number 956861 (Why is no real title available?)
- PSATO: A distributed propositional prover and its application to quasigroup problems
Cited in
(31)- Learning action models from plan examples using weighted MAX-SAT
- Equivalent literal propagation in the DLL procedure
- A satisfiability procedure for quantified Boolean formulae
- SAT problems with chains of dependent variables
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Equivalency reasoning to solve a class of hard SAT problems.
- Extending and implementing the stable model semantics
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Efficient data structures for backtrack search SAT solvers
- Toward leaner binary-clause reasoning in a satisfiability solver
- On deciding subsumption problems
- Complexity results for structure-based causality.
- Formal verification based on Boolean expression diagrams
- Another look at graph coloring via propositional satisfiability
- What we can learn from conflicts in propositional satisfiability
- The state of SAT
- BerkMin: A fast and robust SAT-solver
- Random backtracking in backtrack search algorithms for satisfiability
- An experiment with satisfiability modulo SAT
- Propositional SAT solving
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- 3-Valued Circuit SAT for STE with Automatic Refinement
- Towards Robust CNF Encodings of Cardinality Constraints
- Hierarchical Hardness Models for SAT
- The mechanical verification of a DPLL-based satisfiability solver
- A heuristic block coordinate descent approach for controlled tabular adjustment
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
This page was built for publication: SATO: An efficient propositional prover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234711)
