The quest for efficient Boolean satisfiability solvers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2090309
- Satisfiability-based algorithms for Boolean optimization
- SATRIX -- algorithms for Boolean satisfiability
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Contributions to the theory of practical quantified Boolean formula solving
- Efficient SAT solving under assumptions
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Complete Boolean satisfiability solving algorithms based on local search
Cited in
(58)- A self-adaptive multi-engine solver for quantified Boolean formulas
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Time-optimal short-circuit evaluation of Boolean expressions
- A simple and efficient Boolean solver for constraint logic programming
- Compact and efficiently verifiable models for concurrent systems
- Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models
- Computing with SAT oracles: past, present and future
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Efficient data structures for backtrack search SAT solvers
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Zeon and idem-Clifford formulations of Boolean satisfiability
- Long-distance Q-resolution with dependency schemes
- Complete Boolean satisfiability solving algorithms based on local search
- Search techniques for SAT-based Boolean optimization
- Processes and continuous change in a SAT-based planner
- Selection of search strategies for solving 3-SAT problems
- Towards an efficient library for SAT: A manifesto
- Towards an efficient tableau method for Boolean circuit satisfiability checking
- Building bridges between sets of partial orders
- Empirical study of the anatomy of modern SAT solvers
- An algorithm for direct construction of complete merged processes
- Propositional SAT solving
- DPLL: the core of modern satisfiability solvers
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Boosting SAT solver performance via a new hybrid approach
- A pearl on SAT and SMT solving in Prolog
- scientific article; zbMATH DE number 1975619 (Why is no real title available?)
- scientific article; zbMATH DE number 2084740 (Why is no real title available?)
- scientific article; zbMATH DE number 2084754 (Why is no real title available?)
- Well-founded operators for normal hybrid MKNF knowledge bases
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- Solving constraint satisfaction problems with SAT modulo theories
- Anatomy and empirical evaluation of modern SAT solvers
- Revisiting hyper binary resolution
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- On the Unreasonable Effectiveness of SAT Solvers
- Building strategies into QBF proofs
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- Introduction to propositional satisfiability
- Present and Future of Practical SAT Solving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 2243352 (Why is no real title available?)
- Characterizing Propagation Methods for Boolean Satisfiability
- Recent Findings in Boolean Techniques
- Principles and Practice of Constraint Programming – CP 2004
- Boolean functional synthesis: from under the hood of solvers
- A review on declarative approaches for constrained clustering
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Backjumping for quantified Boolean logic satisfiability
- Formalization and implementation of modern SAT solvers
- SAT-solving in practice, with a tutorial example from supervisory control
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication: The quest for efficient Boolean satisfiability solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804883)
