SATO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Toward leaner binary-clause reasoning in a satisfiability solver
- A case study in the meta-reasoning procedure ND
- Proving consistency assertions for automotive product data management
- scientific article; zbMATH DE number 1956571 (Why is no real title available?)
- scientific article; zbMATH DE number 5510692 (Why is no real title available?)
- Computer Aided Verification
- Theorem proving in technology transfer: The user's point of view
- scientific article; zbMATH DE number 1979551 (Why is no real title available?)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Merging Logic Programs under Answer Set Semantics
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- scientific article; zbMATH DE number 2111140 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- scientific article; zbMATH DE number 2085248 (Why is no real title available?)
- New upper bounds for the problem of maximal satisfiability
- Challenges in Constraint-Based Analysis of Hybrid Systems
- Solving SAT problem by heuristic polarity decision-making algorithm
- scientific article; zbMATH DE number 1696820 (Why is no real title available?)
- The state of SAT
- BerkMin: A fast and robust SAT-solver
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- SatEx: A web-based framework for SAT experimentation
- A parallelization scheme based on work stealing for a class of SAT solvers
- Investigating the existence of orthogonal golf designs via satisfiability testing
- Correct Hardware Design and Verification Methods
- Equivalent literal propagation in the DLL procedure
- Formal Methods in Computer-Aided Design
- SAT problems with chains of dependent variables
- Computer Aided Verification
- Logic Programming and Nonmonotonic Reasoning
- scientific article; zbMATH DE number 1961995 (Why is no real title available?)
- scientific article; zbMATH DE number 2084700 (Why is no real title available?)
- A competitive and cooperative approach to propositional satisfiability
- scientific article; zbMATH DE number 2085281 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Logic for Programming, Artificial Intelligence, and Reasoning
- scientific article; zbMATH DE number 2165692 (Why is no real title available?)
- scientific article; zbMATH DE number 1866898 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Logic Programming and Nonmonotonic Reasoning
- scientific article; zbMATH DE number 1975619 (Why is no real title available?)
- Parallelizing SATZ using dynamic workload balancing
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Logical cryptanalysis as a SAT problem
- Satisfiability Checking of Non-clausal Formulas Using General Matings
- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
- Solving SAT in a distributed cloud: a portfolio approach
- Learning from conflicts in propositional satisfiability
- Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
- Balance and filtering in structured satisfiable problems. (Preliminary report)
- Exploiting the real power of unit propagation lookahead
- Theory and Applications of Satisfiability Testing
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- An experiment with satisfiability modulo SAT
- scientific article; zbMATH DE number 2064232 (Why is no real title available?)
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- Parallelizing SMT solving: lazy decomposition and conciliation
- On black-box optimization in divide-and-conquer SAT solving
- SATO: An efficient propositional prover
- Frame self-orthogonal Mendelsohn triple systems
- Loops with abelian inner mapping groups: an application of automated deduction
- What we can learn from conflicts in propositional satisfiability
- Boundary Points and Resolution
- Extending and implementing the stable model semantics
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- Applying SAT solving in classification of finite algebras
- Propositional SAT solving
- Theory and Applications of Satisfiability Testing
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Search-space partitioning for parallelizing SMT solvers
- Random backtracking in backtrack search algorithms for satisfiability
- A Tutorial on Satisfiability Modulo Theories
- Persistent and quasi-persistent lemmas in propositional model elimination
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Heuristics for the mirrored traveling tournament problem
- Incorporating clause learning in grid-based randomized SAT solving
- An improved SAT formulation for the social golfer problem
- Strategies for Solving SAT in Grids by Randomized Search
- scientific article; zbMATH DE number 1670796 (Why is no real title available?)
- Partitioning SAT instances for distributed solving
- scientific article; zbMATH DE number 2085252 (Why is no real title available?)
- Formalization and implementation of modern SAT solvers
- Formal verification based on Boolean expression diagrams
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Formal Methods for Hardware Verification
- Getting to the airport: The oldest planning problem in AI
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
- Theory and Applications of Satisfiability Testing
- Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles
- The disconnection tableau calculus
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 1538058 (Why is no real title available?)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- scientific article; zbMATH DE number 2080912 (Why is no real title available?)
- scientific article; zbMATH DE number 5834406 (Why is no real title available?)
- Reconfigurable computing. The theory and practice of FPGA-based computation.
This page was built for software: SATO
