PicoSAT
From MaRDI portal
swMATH7092MaRDI QIDQ19150FDOQ19150
Author name not available (Why is that?)
Official website: http://fmv.jku.at/picosat/
Cited In (only showing first 100 items - show all)
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Captain Jack: new variable selection heuristics in local search for SAT
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Two disjoint 5-holes in point sets
- Implementing efficient All solutions SAT solvers
- Generalized conflict-clause strengthening for satisfiability solvers
- Compositional propositional proofs
- DRABT
- Producing and verifying extremely large propositional refutations
- dCAQE
- On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$
- Co-clustering under the maximum norm
- Combinatorial optimization solutions for the maximum quartet consistency problem
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- 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
- Rewriting, inference, and proof
- GANAK
- Expressing symmetry breaking in DRAT proofs
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- Gardens of Eden in the game of life
- Boundary Points and Resolution
- Non-prenex QBF solving using abstraction
- On computing backbones of propositional theories
- Propositional SAT solving
- SAT-solving in CSP trace refinement
- Minimising deterministic Büchi automata precisely using SAT solving
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Solving projected model counting by utilizing treewidth and its limits
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Internal guidance for Satallax
- Eliminating models during model elimination
- QESTO
- A unified framework for DPLL(T) + certificates
- Title not available (Why is that?)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Incremental determinization
- SAT based bounded model checking with partial order semantics for timed automata
- Evaluating CDCL variable scoring schemes
- Quantifier elimination by dependency sequents
- Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning
- Dsharp
- An overview of parallel SAT solving
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- 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
- On tackling the limits of resolution in SAT solving
- Incremental bounded model checking for embedded software
- On improving MUS extraction algorithms
- Smt-Switch
- Q3B
- Strategyproof social choice when preferences and outcomes may contain ties
- Mechanical verification of SAT refutations with extended resolution
- Formalization of Abstract State Transition Systems for SAT
- HordeQBF: a modular and massively parallel QBF solver
- SAT-solving based on boundary point elimination
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Decision procedures. An algorithmic point of view
- Prolog Technology Reinforcement Learning Prover
- Cache conscious data structures for Boolean satisfiability solvers
- Q-resolution with generalized axioms
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Parallel MUS extraction
- Automatically comparing memory consistency models
- Automatic evaluation of context-free grammars (system description)
- ConwayLife
- Assignment stack shrinking
- Testing and debugging techniques for answer set solver development
- Faster, higher, stronger: E 2.3
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- SATenstein: automatically building local search SAT solvers from components
- Algorithms for computing minimal equivalent subformulas
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Curriculum-based course timetabling with SAT and MaxSAT
- RAReQS
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs
- Exact DFA Identification Using SAT Solvers
- Minimal sets on propositional formulae. Problems and reductions
- Two techniques for minimizing resolution proofs
- Failed literal detection for QBF
- Checking EMTLK properties of timed interpreted systems via bounded model checking
- Computing small unsatisfiable cores in satisfiability modulo theories
- Minimally unsatisfiable Boolean circuits
- Formalization and implementation of modern SAT solvers
- SAT-based preprocessing for MaxSAT
- Conflict-driven answer set solving: from theory to practice
- GNT
- HaifaSat
- kcnfs
- MiniSat
- OptSAT
- Pueblo
- tts
- Zchaff2004
- Saturn
- BarcelogicTools
- PSATO
- UBCSAT
This page was built for software: PicoSAT
