SATO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Learning action models from plan examples using weighted MAX-SAT
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- CirCUs
- c-sat
- CsegGraph
- DDDLIB
- HaifaSat
- ManySAT
- March_eq
- MiniSat
- Packlib2
- Scranfilize
- CDCLSym
- UnitWalk
- Verifying the IEEE 1394 fireWire tree identify protocol with SMV
- PLATYPUS
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- 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.
- SatEx
- Uppaal2k
- Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
- Persistent and quasi-persistent lemmas in propositional model elimination
- LPTP
- GridSAT
- HySAT
- SATLIB
- NP-SPEC
- TAPS
- SNIF-ACT
- UBCSAT
- PSATO
- STAN
- MAX-2-SAT
- Equivalency reasoning to solve a class of hard SAT problems.
- Parallelization of a hyper-linking-based theorem prover
- A taxonomy of parallel strategies for deduction
- Extending and implementing the stable model semantics
- SAT-based decision procedures for classical modal logics
- Walksat
- Siege
- QingTing1
- PBS
- SAT competition
- SATIRE
- zChaff
- Parallelizing SMT solving: lazy decomposition and conciliation
- An improved SAT formulation for the social golfer problem
- 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
- Frame self-orthogonal Mendelsohn triple systems
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
- Autarky pruning in propositional model elimination reduces failure redundancy
- A complete adaptive algorithm for propositional satisfiability
- FINDER
- Complexity results for structure-based causality.
- Theorem proving in technology transfer: The user's point of view
- An overview of backtrack search satisfiability algorithms
- GrAnDe
- DCTP
- SCOTT
- Chaff
- BerkMin
- PaMiraXT
- PaQuBE
- PicoSAT
- Quaffle
- Formal verification based on Boolean expression diagrams
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- A propositional theorem prover to solve planning and other problems
- Lemma and cut strategies for propositional model elimination
- PrecoSAT
- DIMACS
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- CVC
- Jerusat
- QUBOS
- SATORI
- MGTP
- HeerHugo
- HANNIBAL
- SOCRATES
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- XHSTT
- Solving SAT in a distributed cloud: a portfolio approach
- XtremWeb
- SArTagnan
- PMiniSAT
- NAGSAT
- PMSat
- Picoso
- QMiraXT
- ZetaSAT
- GridJM
- ppfolio
This page was built for software: SATO
