Propositional SAT solving
From MaRDI portal
Publication:3176367
DOI10.1007/978-3-319-10575-8_9zbMATH Open1392.68380OpenAlexW2803654607MaRDI QIDQ3176367FDOQ3176367
Sharad Malik, Joao Marques-Silva
Publication date: 20 July 2018
Published in: Handbook of Model Checking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_9
Recommendations
Cites Work
- ManySAT: a parallel SAT solver
- Theory and Applications of Satisfiability Testing
- BerkMin: A fast and robust SAT-solver
- Title not available (Why is that?)
- Minimaxsat: an efficient weighted Max-SAT solver
- Graph-Based Algorithms for Boolean Function Manipulation
- A structure-preserving clause form translation
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Solving QBF with Counterexample Guided Refinement
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Property-directed incremental invariant generation
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- The complexity of theorem-proving procedures
- Computer Aided Verification
- Iterative and core-guided maxsat solving: a survey and assessment
- Towards efficient MUS extraction
- SAT-based MaxSAT algorithms
- Title not available (Why is that?)
- Reasoning with minimal models: efficient algorithms and applications
- Solving SAT and SAT Modulo Theories
- GRASP: a search algorithm for propositional satisfiability
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Implementing the Davis-Putnam method
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Inprocessing Rules
- SAT-Based Model Checking without Unrolling
- Title not available (Why is that?)
- The Complexity of Propositional Proofs
- SATO: An efficient propositional prover
- Title not available (Why is that?)
- On computing minimal models
- A linear-time transformation of linear inequalities into conjunctive normal form
- Title not available (Why is that?)
- Simulating circuit-level simplifications on CNF
- Extended clause learning
- Title not available (Why is that?)
- Forward checking and intelligent backtracking
- Satisfiability-based algorithms for Boolean optimization
- Tools and Algorithms for the Construction and Analysis of Systems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Title not available (Why is that?)
- Efficient data structures for backtrack search SAT solvers
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Title not available (Why is that?)
- Theory and applications of satisfiability testing -- SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30--July 3, 2009. Proceedings
- Cardinality networks: a theoretical and empirical study
- New Encodings of Pseudo-Boolean Constraints into CNF
- Title not available (Why is that?)
- Finding Dominators in Directed Graphs
- Title not available (Why is that?)
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18--21, 2000. Proceedings
- On Computing Backbones of Propositional Theories
- Title not available (Why is that?)
- A New Look at BDDs for Pseudo-Boolean Constraints
- Tools and Algorithms for the Construction and Analysis of Systems
- Variable Dependency in Local Search: Prevention Is Better Than Cure
- Extending Clause Learning DPLL with Parity Reasoning
Cited In (17)
- Proof complexity of modal resolution
- Solving String Theories Involving Regular Membership Predicates Using SAT
- Propositional proof systems based on maximum satisfiability
- Title not available (Why is that?)
- A modal view on resource-bounded propositional logics
- SAT modulo symmetries for graph generation and enumeration
- Title not available (Why is that?)
- Model checking with Boolean Satisfiability
- Using Boolean Constraint Propagation for Sub-clauses Deduction
- RegSTAB: A SAT Solver for Propositional Schemata
- Model Checking Security Protocols
- Combining Model Checking and Deduction
- Binary Decision Diagrams
- A Pearl on SAT Solving in Prolog
- Title not available (Why is that?)
- Separating signs in the propositional satisfiability problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: Propositional SAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176367)
