Pages that link to "Item:Q5234711"
From MaRDI portal
The following pages link to SATO: An efficient propositional prover (Q5234711):
Displaying 31 items.
- An experiment with satisfiability modulo SAT (Q287334) (← links)
- A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Equivalency reasoning to solve a class of hard SAT problems. (Q1589482) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- Toward leaner binary-clause reasoning in a satisfiability solver (Q1777406) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- The state of SAT (Q2643296) (← links)
- BerkMin: A fast and robust SAT-solver (Q2643301) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- 3-Valued Circuit SAT for STE with Automatic Refinement (Q3510816) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Hierarchical Hardness Models for SAT (Q3523084) (← links)
- The Mechanical Verification of a DPLL-Based Satisfiability Solver (Q5179007) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)