PicoSAT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Q-resolution with generalized axioms
- Captain Jack: new variable selection heuristics in local search for SAT
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Parallel MUS extraction
- Faster, higher, stronger: E 2.3
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Two disjoint 5-holes in point sets
- Generalized conflict-clause strengthening for satisfiability solvers
- Implementing efficient All solutions SAT solvers
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Compositional propositional proofs
- Producing and verifying extremely large propositional refutations
- SATenstein: automatically building local search SAT solvers from components
- DRABT
- ConwayLife
- Automatically comparing memory consistency models
- Co-clustering under the maximum norm
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$
- Algorithms for computing minimal equivalent subformulas
- A proof builder for Max-SAT
- DQBDD: an efficient BDD-based DQBF solver
- OptiLog: a framework for SAT-based systems
- On dedicated CDCL strategies for PB solvers
- Combinatorial optimization solutions for the maximum quartet consistency problem
- Automatic evaluation of context-free grammars (system description)
- Rewriting, inference, and proof
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Expressing symmetry breaking in DRAT proofs
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- Curriculum-based course timetabling with SAT and MaxSAT
- Gardens of Eden in the game of life
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs
- Exact DFA Identification Using SAT Solvers
- SAT-solving in CSP trace refinement
- Non-prenex QBF solving using abstraction
- Boundary Points and Resolution
- On computing backbones of propositional theories
- Propositional SAT solving
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Minimal sets on propositional formulae. Problems and reductions
- Solving projected model counting by utilizing treewidth and its limits
- Minimising deterministic Büchi automata precisely using SAT solving
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Failed literal detection for QBF
- Two techniques for minimizing resolution proofs
- Internal guidance for Satallax
- Checking EMTLK properties of timed interpreted systems via bounded model checking
- Formalization and implementation of modern SAT solvers
- Eliminating models during model elimination
- Computing small unsatisfiable cores in satisfiability modulo theories
- Minimally unsatisfiable Boolean circuits
- SAT-based preprocessing for MaxSAT
- A unified framework for DPLL(T) + certificates
- GNT
- HaifaSat
- kcnfs
- MiniSat
- OptSAT
- Pueblo
- tts
- Zchaff2004
- Saturn
- BarcelogicTools
- PSATO
- UBCSAT
- POEM
- Siege
- SATO
- PBS
- SATIRE
- JBool
- BerkMin
- Chaff
- NiVER
- PaMiraXT
- Plingeling
- Quaffle
- Sat4j
- PrecoSAT
- OPIUM
- Eureka
- Bloqqer
- Jerusat
- Nenofex
- HeerHugo
- QBFLIB
- QUBOS
- Equinox
- dynASP
- MiniMaxSat
- MSUnCore
- Open-WBO
- SOCRATES
- CirQit2
- antom
- tawSolver
- iClingo
- PMSat
This page was built for software: PicoSAT
