The following pages link to (Q4804883):
Displaying 45 items.
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Time-optimal short-circuit evaluation of Boolean expressions (Q1115174) (← links)
- A simple and efficient Boolean solver for constraint logic programming (Q1357667) (← links)
- Compact and efficiently verifiable models for concurrent systems (Q1620959) (← links)
- Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models (Q1642751) (← links)
- Computing with SAT oracles: past, present and future (Q1670750) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Zeon and idem-Clifford formulations of Boolean satisfiability (Q2274729) (← links)
- Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Search techniques for SAT-based Boolean optimization (Q2455454) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Selection of search strategies for solving 3-SAT problems (Q2511762) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- (Q2767086) (← links)
- Building Bridges Between Sets of Partial Orders (Q2799169) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- (Q3429158) (← links)
- (Q3429161) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- (Q4475671) (← links)
- Well-founded operators for normal hybrid MKNF knowledge bases (Q4592713) (← links)
- (Q4809068) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- (Q5090460) (← links)
- (Q5457277) (← links)
- Theory and Applications of Satisfiability Testing (Q5714754) (← links)
- Theory and Applications of Satisfiability Testing (Q5714769) (← links)
- Characterizing Propagation Methods for Boolean Satisfiability (Q5756574) (← links)
- Recent Findings in Boolean Techniques (Q5856082) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900325) (← links)
- Boolean functional synthesis: from under the hood of solvers (Q6132564) (← links)
- A review on declarative approaches for constrained clustering (Q6577669) (← links)
