PicoSAT

swMATH7092MaRDI QIDQ19150FDOQ19150

Author name not available (Why is that?)

Cited In (85)

• Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
• Captain Jack: new variable selection heuristics in local search for SAT
• Faster, higher, stronger: E 2.3
• Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• Two disjoint 5-holes in point sets
• Generalized conflict-clause strengthening for satisfiability solvers
• Compositional propositional proofs
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• SATenstein: automatically building local search SAT solvers from components
• Producing and verifying extremely large propositional refutations
• 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
• Algorithms for computing minimal equivalent subformulas
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Expressing symmetry breaking in DRAT proofs
• Gardens of Eden in the game of life
• Curriculum-based course timetabling with SAT and MaxSAT
• Labelled interpolation systems for hyper-resolution, clausal, and local proofs
• Exact DFA Identification Using SAT Solvers
• 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
• Taming high treewidth with abstraction, nested dynamic programming, and database technology
• Solving projected model counting by utilizing treewidth and its limits
• Minimal sets on propositional formulae. Problems and reductions
• Practical algorithms for unsatisfiability proof and core generation in SAT solvers
• Two techniques for minimizing resolution proofs
• Failed literal detection for QBF
• Internal guidance for Satallax
• 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
• A unified framework for DPLL(T) + certificates
• Conflict-driven answer set solving: from theory to practice
• 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
• Automated testing and debugging of SAT and QBF solvers
• Evaluating CDCL variable scoring schemes
• Iterative and core-guided maxsat solving: a survey and assessment
• Quantifier elimination by dependency sequents
• Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning
• 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
• Strategyproof social choice when preferences and outcomes may contain ties
• Mechanical verification of SAT refutations with extended resolution
• Algorithms for Weighted Boolean Optimization
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Formalization of Abstract State Transition Systems for SAT
• SAT-solving based on boundary point elimination
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• MUSer2: an efficient MUS extractor
• Cobra: a tool for solving general deductive games
• Decision procedures. An algorithmic point of view
• Cache conscious data structures for Boolean satisfiability solvers
• Q-resolution with generalized axioms
• Parallel MUS extraction
• Implementing efficient All solutions SAT solvers
• Automatically comparing memory consistency models
• Automatic evaluation of context-free grammars (system description)
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• Minimising deterministic Büchi automata precisely using SAT solving
• Eliminating models during model elimination
• Assignment stack shrinking
• Testing and debugging techniques for answer set solver development
• HordeQBF: a modular and massively parallel QBF solver
• Prolog Technology Reinforcement Learning Prover
• Faradžev Read-type enumeration of non-isomorphic CC systems

This page was built for software: PicoSAT