The following pages link to PicoSAT (Q19150):
Displaying 50 items.
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs (Q286731) (← links)
- Checking EMTLK properties of timed interpreted systems via bounded model checking (Q310082) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning (Q682374) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- On tackling the limits of resolution in SAT solving (Q1680253) (← links)
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Rewriting logic and its applications. 8th international workshop, WRLA 2010, held as a satellite event of ETAPS 2010, Paphos, Cyprus, March 20--21, 2010. Revised selected papers (Q1958747) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Gardens of Eden in the game of life (Q2086742) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- DQBDD: an efficient BDD-based DQBF solver (Q2118347) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Faster, higher, stronger: E 2.3 (Q2305435) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A unified framework for DPLL(T) + certificates (Q2375732) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Taming high treewidth with abstraction, nested dynamic programming, and database technology (Q2661361) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- Incremental Determinization (Q2818028) (← links)
- Non-prenex QBF Solving Using Abstraction (Q2818029) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- SAT-Based Preprocessing for MaxSAT (Q2870118) (← links)
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories (Q2996914) (← links)
- On Computing Backbones of Propositional Theories (Q2999099) (← links)
- (Q3005895) (← links)
- Minimally Unsatisfiable Boolean Circuits (Q3007680) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
