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?)
• HordeQBF: A Modular and Massively Parallel QBF Solver
• Formal Methods in Computer-Aided Design
• Partitioning Search Spaces of a Randomized Search
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic Programming and Nonmonotonic Reasoning
• Title not available (Why is that?)
• Satisfiability Checking of Non-clausal Formulas Using General Matings
• Logical cryptanalysis as a SAT problem
• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
• Solving SAT in a distributed cloud: a portfolio approach
• On black-box optimization in divide-and-conquer SAT solving
• What we can learn from conflicts in propositional satisfiability
• MACE4 and SEM: A Comparison of Finite Model Generators
• Strategies for Solving SAT in Grids by Randomized Search
• Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Correct Hardware Design and Verification Methods
• Embedded software verification using symbolic execution and uninterpreted functions
• Title not available (Why is that?)
• Another Complete Local Search Method for SAT
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing
• 3-Valued Circuit SAT for STE with Automatic Refinement
• Title not available (Why is that?)
• Search techniques for SAT-based Boolean optimization
• Lemma and cut strategies for propositional model elimination
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• A case study in the meta-reasoning procedure ND
• Title not available (Why is that?)
• Proving consistency assertions for automotive product data management
• 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)\)

This page was built for software: SATO