The following pages link to SATO (Q16627):
Displaying 50 items.
- An experiment with satisfiability modulo SAT (Q287334) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← 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)
- An effective algorithm for the futile questioning problem (Q812439) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← 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)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- A collaborative approach for multi-threaded SAT solving (Q839500) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Applying SAT solving in classification of finite algebras (Q862393) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Verifying the IEEE 1394 fireWire tree identify protocol with SMV (Q1402475) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← 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)
- Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems (Q1430293) (← links)
- Persistent and quasi-persistent lemmas in propositional model elimination (Q1430298) (← links)
- Equivalency reasoning to solve a class of hard SAT problems. (Q1589482) (← links)
- Parallelization of a hyper-linking-based theorem prover (Q1595925) (← links)
- A taxonomy of parallel strategies for deduction (Q1601867) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- SAT-based decision procedures for classical modal logics (Q1610667) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← 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)
- Frame self-orthogonal Mendelsohn triple systems (Q1780305) (← links)
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing (Q1799096) (← links)
- Autarky pruning in propositional model elimination reduces failure redundancy (Q1808886) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Theorem proving in technology transfer: The user's point of view (Q1856140) (← links)
- An overview of backtrack search satisfiability algorithms (Q1861908) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
