SATO

swMATH4451MaRDI QIDQ16627

No author found.

Related Items (only showing first 100 items - show all)

PSATO: A distributed propositional prover and its application to quasigroup problems ⋮ An experiment with satisfiability modulo SAT ⋮ Formalization and implementation of modern SAT solvers ⋮ A collaborative approach for multi-threaded SAT solving ⋮ What we can learn from conflicts in propositional satisfiability ⋮ Search-Space Partitioning for Parallelizing SMT Solvers ⋮ Evaluating CDCL Variable Scoring Schemes ⋮ Propositional SAT Solving ⋮ SAT-solving in practice, with a tutorial example from supervisory control ⋮ Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The state of SAT ⋮ BerkMin: A fast and robust SAT-solver ⋮ Random backtracking in backtrack search algorithms for satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) ⋮ Applying SAT solving in classification of finite algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Heuristics for the mirrored traveling tournament problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The disconnection tableau calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL ⋮ Unnamed Item ⋮ Formalization of Abstract State Transition Systems for SAT ⋮ Unnamed Item ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ New upper bounds for the problem of maximal satisfiability ⋮ Verifying the IEEE 1394 fireWire tree identify protocol with SMV ⋮ Learning from conflicts in propositional satisfiability ⋮ 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 ⋮ Unnamed Item ⋮ Formal verification based on Boolean expression diagrams ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems ⋮ Persistent and quasi-persistent lemmas in propositional model elimination ⋮ Search techniques for SAT-based Boolean optimization ⋮ An efficient solver for weighted Max-SAT ⋮ Towards a unified model of search in theorem-proving: subgoal-reduction strategies ⋮ An overview of parallel SAT solving ⋮ Unnamed Item ⋮ 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 ⋮ Solving SAT problem by heuristic polarity decision-making algorithm ⋮ Another look at graph coloring via propositional satisfiability ⋮ Parallelizing SMT solving: lazy decomposition and conciliation ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ An improved SAT formulation for the social golfer problem ⋮ A heuristic block coordinate descent approach for controlled tabular adjustment ⋮ 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 ⋮ RobinX: a three-field classification and unified data format for round-robin sports timetabling ⋮ Frame self-orthogonal Mendelsohn triple systems ⋮ Embedded software verification using symbolic execution and uninterpreted functions ⋮ The Boolean Constraint Solver of SWI-Prolog (System Description) ⋮ Investigating the existence of large sets of idempotent quasigroups via satisfiability testing ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ Autarky pruning in propositional model elimination reduces failure redundancy ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ On the resolution of bipolar max-min equations ⋮ Learning action models from plan examples using weighted MAX-SAT ⋮ Partitioning Search Spaces of a Randomized Search ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems ⋮ \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver ⋮ Equivalency reasoning to solve a class of hard SAT problems. ⋮ Complexity results for structure-based causality. ⋮ Parallelization of a hyper-linking-based theorem prover ⋮ Theorem proving in technology transfer: The user's point of view ⋮ Semidefinite programming based approaches to the break minimization problem ⋮ An overview of backtrack search satisfiability algorithms ⋮ A taxonomy of parallel strategies for deduction ⋮ Extending and implementing the stable model semantics ⋮ An effective algorithm for the futile questioning problem ⋮ A parallelization scheme based on work stealing for a class of SAT solvers ⋮ A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system ⋮ SAT-based planning in complex domains: Concurrency, constraints and nondeterminism ⋮ SAT-based decision procedures for classical modal logics ⋮ Leveraging GPUs for effective clause sharing in parallel SAT solving

This page was built for software: SATO