Propositional SAT Solving
From MaRDI portal
Publication:3176367
DOI10.1007/978-3-319-10575-8_9zbMath1392.68380OpenAlexW2803654607MaRDI QIDQ3176367
Sharad Malik, João P. 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Proof complexity of modal resolution ⋮ Binary Decision Diagrams ⋮ Combining Model Checking and Deduction ⋮ Model Checking Security Protocols ⋮ A modal view on resource-bounded propositional logics ⋮ Propositional proof systems based on maximum satisfiability ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time transformation of linear inequalities into conjunctive normal form
- Simulating circuit-level simplifications on CNF
- SAT-based MaxSAT algorithms
- Cardinality networks: a theoretical and empirical study
- Extended clause learning
- Property-directed incremental invariant generation
- Theory and applications of satisfiability testing -- SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30--July 3, 2009. Proceedings
- A structure-preserving clause form translation
- Reasoning with minimal models: efficient algorithms and applications
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Forward checking and intelligent backtracking
- On computing minimal models
- Satisfiability-based algorithms for Boolean optimization
- Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18--21, 2000. Proceedings
- Efficient data structures for backtrack search SAT solvers
- Implementing the Davis-Putnam method
- Iterative and core-guided maxsat solving: a survey and assessment
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- BerkMin: A fast and robust SAT-solver
- Solving QBF with Counterexample Guided Refinement
- Inprocessing Rules
- On Computing Backbones of Propositional Theories
- Extending Clause Learning DPLL with Parity Reasoning
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- SAT-Based Model Checking without Unrolling
- A New Look at BDDs for Pseudo-Boolean Constraints
- Towards efficient MUS extraction
- Solving SAT and SAT Modulo Theories
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Variable Dependency in Local Search: Prevention Is Better Than Cure
- New Encodings of Pseudo-Boolean Constraints into CNF
- Graph-Based Algorithms for Boolean Function Manipulation
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Finding Dominators in Directed Graphs
- GRASP: a search algorithm for propositional satisfiability
- The Complexity of Propositional Proofs
- SATO: An efficient propositional prover
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Computer Aided Verification
This page was built for publication: Propositional SAT Solving
