PicoSAT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- GNT
- HaifaSat
- kcnfs
- MiniSat
- OptSAT
- Pueblo
- Smt-Switch
- Q3B
- Dsharp
- GANAK
- tts
- Zchaff2004
- Saturn
- BarcelogicTools
- UBCSAT
- PSATO
- POEM
- Siege
- SATO
- Minimal sets on propositional formulae. Problems and reductions
- PBS
- On tackling the limits of resolution in SAT solving
- SATIRE
- Incremental bounded model checking for embedded software
- Co-clustering under the maximum norm
- Conflict-driven answer set solving: from theory to practice
- JBool
- Chaff
- BerkMin
- NiVER
- PaMiraXT
- Plingeling
- Quaffle
- Sat4j
- 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
- PrecoSAT
- OPIUM
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- Gardens of Eden in the game of life
- OptiLog: a framework for SAT-based systems
- On dedicated CDCL strategies for PB solvers
- A proof builder for Max-SAT
- DQBDD: an efficient BDD-based DQBF solver
- Eliminating models during model elimination
- Jerusat
- Eureka
- Bloqqer
- Nenofex
- QUBOS
- QBFLIB
- HeerHugo
- MiniMaxSat
- MSUnCore
- Equinox
- dynASP
- Open-WBO
- SOCRATES
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- tawSolver
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Faster, higher, stronger: E 2.3
- CirQit2
- iClingo
- PMSat
- QMiraXT
- antom
- Iterative and core-guided maxsat solving: a survey and assessment
- A unified framework for DPLL(T) + certificates
- MUP
- AMUSE
- NSPLib
- RSat
- EVC
- MUSer2
- Cobra
- SATenstein
- SATenstein: automatically building local search SAT solvers from components
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Strategyproof social choice when preferences and outcomes may contain ties
- Solving projected model counting by utilizing treewidth and its limits
- Internal guidance for Satallax
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- Incremental determinization
- Non-prenex QBF solving using abstraction
- Q-resolution with generalized axioms
- HordeQBF: a modular and massively parallel QBF solver
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs
- SAT-based preprocessing for MaxSAT
- Computing small unsatisfiable cores in satisfiability modulo theories
- On computing backbones of propositional theories
- Combinatorial optimization solutions for the maximum quartet consistency problem
- Minimally unsatisfiable Boolean circuits
- On improving MUS extraction algorithms
- Failed literal detection for QBF
- Captain Jack: new variable selection heuristics in local search for SAT
- Generalized conflict-clause strengthening for satisfiability solvers
- JavaSMT
- MPIDepQBF
This page was built for software: PicoSAT
