SATO

swMATH4451MaRDI QIDQ16627FDOQ16627

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Theorem proving in technology transfer: The user's point of view
• New upper bounds for the problem of maximal satisfiability
• Theory and Applications of Satisfiability Testing
• Logic for Programming, Artificial Intelligence, and Reasoning
• The Boolean Constraint Solver of SWI-Prolog (System Description)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalent literal propagation in the DLL procedure
• SAT problems with chains of dependent variables
• A competitive and cooperative approach to propositional satisfiability
• Title not available (Why is that?)
• Parallelizing SMT solving: lazy decomposition and conciliation
• Frame self-orthogonal Mendelsohn triple systems
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Applying SAT solving in classification of finite algebras
• Random backtracking in backtrack search algorithms for satisfiability
• Persistent and quasi-persistent lemmas in propositional model elimination
• The Mechanical Verification of a DPLL-Based Satisfiability Solver
• Formal verification based on Boolean expression diagrams
• Theory and Applications of Satisfiability Testing
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Getting to the airport: The oldest planning problem in AI
• The disconnection tableau calculus
• Title not available (Why is that?)
• On SAT instance classes and a method for reliable performance experiments with SAT solvers
• On the use of autarkies for satisfiability decision
• Leveraging GPUs for effective clause sharing in parallel SAT solving
• Mechanizing Mathematical Reasoning
• Principles and Practice of Constraint Programming – CP 2003
• Title not available (Why is that?)
• Propositional SAT Solving
• On deciding subsumption problems
• Search-Space Partitioning for Parallelizing SMT Solvers
• A complete adaptive algorithm for propositional satisfiability
• Stochastic systematic search algorithms for satisfiability
• Logic Programming and Nonmonotonic Reasoning
• Parallelization of a hyper-linking-based theorem prover
• Theory and Applications of Satisfiability Testing
• SAT-solving in practice, with a tutorial example from supervisory control
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• SAT-based decision procedures for classical modal logics
• Title not available (Why is that?)
• Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction
• Formalization of Abstract State Transition Systems for SAT
• Title not available (Why is that?)
• A taxonomy of parallel strategies for deduction
• Title not available (Why is that?)
• A Powerful Technique to Eliminate Isomorphism in Finite Model Search
• An effective algorithm for the futile questioning problem
• Combining enumeration and deductive techniques in order to increase the class of constructible infinite models
• Equivalency reasoning to solve a class of hard SAT problems.
• Computer Aided Verification
• Title not available (Why is that?)
• Merging Logic Programs under Answer Set Semantics
• PSATO: A distributed propositional prover and its application to quasigroup problems
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Challenges in Constraint-Based Analysis of Hybrid Systems
• Solving SAT problem by heuristic polarity decision-making algorithm
• 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
• Correct Hardware Design and Verification Methods
• A parallelization scheme based on work stealing for a class of SAT solvers
• Computer Aided Verification
• Logic Programming and Nonmonotonic Reasoning
• Computer Aided Verification
• Theory and Applications of Satisfiability Testing
• Parallelizing SATZ using dynamic workload balancing
• PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
• Theory and Applications of Satisfiability Testing
• Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
• Learning from conflicts in propositional satisfiability
• Balance and filtering in structured satisfiable problems. (Preliminary report)
• Exploiting the real power of unit propagation lookahead
• Title not available (Why is that?)
• Title not available (Why is that?)
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• SATO: An efficient propositional prover
• An experiment with satisfiability modulo SAT
• Theory and Applications of Satisfiability Testing
• Boundary Points and Resolution
• A Tutorial on Satisfiability Modulo Theories
• Extending and implementing the stable model semantics
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Incorporating clause learning in grid-based randomized SAT solving
• Heuristics for the mirrored traveling tournament problem

This page was built for software: SATO