PicoSAT

swMATH7092MaRDI QIDQ19150FDOQ19150

Author name not available (Why is that?)

Cited In (85)

• Assignment Stack Shrinking
• Automatically comparing memory consistency models
• HordeQBF: A Modular and Massively Parallel QBF Solver
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• Eliminating models during model elimination
• Parallel MUS Extraction
• Implementing Efficient All Solutions SAT Solvers
• Automatic Evaluation of Context-Free Grammars (System Description)
• Testing and debugging techniques for answer set solver development
• Minimising Deterministic Büchi Automata Precisely Using SAT Solving
• Prolog Technology Reinforcement Learning Prover
• Faradžev Read-type enumeration of non-isomorphic CC systems
• 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)\)
• On Improving MUS Extraction Algorithms
• Two disjoint 5-holes in point sets
• 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
• 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
• Algorithms for computing minimal equivalent subformulas
• Automated Testing and Debugging of SAT and QBF Solvers
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Q-Resolution with Generalized Axioms
• Gardens of Eden in the game of life
• Curriculum-based course timetabling with SAT and MaxSAT
• Cobra: A Tool for Solving General Deductive Games
• Labelled interpolation systems for hyper-resolution, clausal, and local proofs
• Exact DFA Identification Using SAT Solvers
• Boundary Points and Resolution
• SAT-solving in CSP trace refinement
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT
• 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
• Generalized Conflict-Clause Strengthening for Satisfiability Solvers
• Checking EMTLK properties of timed interpreted systems via bounded model checking
• Formalization and implementation of modern SAT solvers
• Compositional Propositional Proofs
• Mechanical Verification of SAT Refutations with Extended Resolution
• A unified framework for DPLL(T) + certificates
• Conflict-driven answer set solving: from theory to practice
• Non-prenex QBF Solving Using Abstraction
• Title not available (Why is that?)
• Improving Unsatisfiability-Based Algorithms for Boolean Optimization
• Title not available (Why is that?)
• Expressing Symmetry Breaking in DRAT Proofs
• On Computing Backbones of Propositional Theories
• Propositional SAT Solving
• Internal Guidance for Satallax
• SAT-Solving Based on Boundary Point Elimination
• Title not available (Why is that?)
• Iterative and core-guided maxsat solving: a survey and assessment
• Quantifier elimination by dependency sequents
• Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
• Failed Literal Detection for QBF
• 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
• Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
• Minimally Unsatisfiable Boolean Circuits
• On tackling the limits of resolution in SAT solving
• Incremental bounded model checking for embedded software
• SAT-Based Preprocessing for MaxSAT
• Strategyproof social choice when preferences and outcomes may contain ties
• Rewriting, Inference, and Proof
• Incremental Determinization
• Title not available (Why is that?)
• Algorithms for Weighted Boolean Optimization
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Formalization of Abstract State Transition Systems for SAT
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Decision procedures. An algorithmic point of view
• Evaluating CDCL Variable Scoring Schemes
• Two Techniques for Minimizing Resolution Proofs
• SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

This page was built for software: PicoSAT