Reasoning with propositional logic: from SAT solvers to knowledge compilation
From MaRDI portal
Publication:6602252
DOI10.1007/978-3-030-06167-8_5zbMATH Open1547.68729MaRDI QIDQ6602252FDOQ6602252
Publication date: 11 September 2024
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Blocked Clause Elimination for QBF
- Graph-Based Algorithms for Boolean Function Manipulation
- Relations between average case complexity and approximation complexity
- Title not available (Why is that?)
- Resolution for quantified Boolean formulas
- Theory and Applications of Satisfiability Testing
- The complexity of theorem-proving procedures
- Diagnosing multiple faults
- Title not available (Why is that?)
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- SAT-Based Model Checking without Unrolling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Many hard examples for resolution
- Characterizing diagnoses and systems
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- Theory and Applications of Satisfiability Testing
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A Generalized Framework for Conflict Analysis
- Theory and Applications of Satisfiability Testing
- Random formulas have frozen variables
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
- On the complexity of regular resolution and the Davis-Putnam procedure
- On Compiling CNFs into Structured Deterministic DNNFs
- Average time analyses of simplified Davis-Putnam procedures
- Backjumping for quantified Boolean logic satisfiability
- The asymptotic \(k\)-SAT threshold
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Reasoning with propositional logic: from SAT solvers to knowledge compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602252)
