The following pages link to MiniSat (Q13332):
Displaying 50 items.
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) (← links)
- CDCLSym: introducing effective symmetry breaking in SAT solving (Q2324209) (← links)
- An iterative method for linear decomposition of index generating functions (Q2325307) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- A novel SAT solver for the van der Waerden numbers (Q2338161) (← links)
- Bigraphs with sharing (Q2339468) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- View-based propagator derivation (Q2342586) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Reducing higher-order theorem proving to a sequence of SAT problems (Q2351156) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Lego-like spheres and tori (Q2362132) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- A unified framework for DPLL(T) + certificates (Q2375732) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- Formal methods for reasoning and uncertainty reduction in evidential grid maps (Q2407931) (← links)
- Modular strategic SMT solving with \textbf{SMT-RAT} (Q2414693) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Unified QBF certification and its applications (Q2441712) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- A SAT-based parser and completer for pictures specified by tiling (Q2459547) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Improving implementation of SAT competitions 2017--2019 winners (Q2661342) (← links)
- Abstract cores in implicit hitting set MaxSat solving (Q2661355) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- Tighter bounds on directed Ramsey number \(R(7)\) (Q2676760) (← links)
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring (Q2694562) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
