Disjunctive closures for knowledge compilation
From MaRDI portal
Publication:460617
DOI10.1016/j.artint.2014.07.004zbMath1405.68375OpenAlexW1973641462MaRDI QIDQ460617
Hélène Fargier, Pierre Marquis
Publication date: 13 October 2014
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.07.004
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items
No Efficient Disjunction or Conjunction of Switch-Lists, Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem, On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models and quantifier elimination for quantified Horn formulas
- Reasoning under inconsistency: a forgetting-based approach
- Negation as failure: careful closure procedure
- On the relationship between circumscription and negation as failure
- Structure identification in relational data
- A linear algorithm for renaming a set of clauses as a Horn set
- Deduction in non-Horn databases
- Complexity of generalized satisfiability counting problems
- On the hardness of approximate reasoning
- Knowledge Compilation for Closed World Reasoning and Circumscription
- Knowledge Compilation with Empowerment
- Backdoors to Satisfaction
- Transformations into Normal Forms for Quantified Circuits
- Solution Enumeration for Projected Boolean Search Problems
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Recognizing disguised NR(1) instances of the satisfiability problem
- Renaming a Set of Clauses as a Horn Set
- Knowledge compilation and theory approximation
- Theory and Applications of Satisfiability Testing
- The complexity of satisfiability problems
- Decomposable negation normal form
- Formal Methods in Computer-Aided Design
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
- Depth-First Search and Linear Graph Algorithms
- On sentences which are true of direct unions of algebras
- The decision problem for some classes of sentences without quantifiers
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Computer Aided Verification
