Reasoning with propositional logic: from SAT solvers to knowledge compilation

DOI10.1007/978-3-030-06167-8_5zbMATH Open1547.68729MaRDI QIDQ6602252

Laurent Simon

Publication date: 11 September 2024

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average time analyses of simplified Davis-Putnam procedures
• Backjumping for quantified Boolean logic satisfiability
• The asymptotic \(k\)-SAT threshold
• Diagnosing multiple faults
• Characterizing diagnoses and systems
• On the complexity of regular resolution and the Davis-Putnam procedure
• Resolution for quantified Boolean formulas
• SAT-Based Model Checking without Unrolling
• Lazy Clause Exchange Policy for Parallel SAT Solvers
• On Compiling CNFs into Structured Deterministic DNNFs
• Many hard examples for resolution
• A Generalized Framework for Conflict Analysis
• Relations between average case complexity and approximation complexity
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Graph-Based Algorithms for Boolean Function Manipulation
• Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
• Random Formulas Have Frozen Variables
• Blocked Clause Elimination for QBF
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Reasoning with propositional logic: from SAT solvers to knowledge compilation