The following pages link to MiniSat (Q13332):
Displaying 50 items.
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (Q968351) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- New developments in the theory of Gröbner bases and applications to formal verification (Q1017680) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Topological configurations \((n_4)\) exist for all \(n\geq 17\) (Q1041596) (← links)
- Constructing infinite models represented by tree automata (Q1044230) (← links)
- Increasing interpretations (Q1044231) (← links)
- Programming challenges. The programming contest training manual. (Q1409073) (← links)
- Tableau reasoning for description logics and its extension to probabilities (Q1653448) (← links)
- Chronological backtracking (Q1656569) (← links)
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
- Symmetric explanation learning: effective dynamic symmetry handling for SAT (Q1680245) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- Improving MCS enumeration via caching (Q1680254) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency (Q1685966) (← links)
- On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Auto-tabling for subproblem presolving in MiniZinc (Q1701238) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- The incremental satisfiability problem for a two conjunctive normal form (Q1744433) (← links)
- Parallelizing SMT solving: lazy decomposition and conciliation (Q1749390) (← links)
- Axiomatizing Jaśkowski's discussive logic \(\mathbf{D_2}\) (Q1756595) (← links)
- On the independence of axioms in BL and MTL (Q1759710) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- An assumption-based approach for solving the minimal S5-satisfiability problem (Q1799062) (← links)
- A generic framework for implicate generation modulo theories (Q1799090) (← links)
- The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
- Exploiting partial variable assignment in interpolation-based model checking (Q2009611) (← links)
- Sharpening constraint programming approaches for bit-vector theory (Q2011567) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- SAT and IP based algorithms for magic labeling including a complete search for total magic labelings (Q2018542) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- CompoSAT: specification-guided coverage for model finding (Q2024373) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
