Disjunctive closures for knowledge compilation

DOI10.1016/J.ARTINT.2014.07.004MaRDI QIDQ460617zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

computational complexityknowledge representationknowledge compilation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1946853
• Knowledge compilation for closed world reasoning and circumscription
• Knowledge compilation and theory approximation
• Decomposable negation normal form
• Duality in Knowledge Compilation Techniques

Cites work

• scientific article; zbMATH DE number 4085614 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 1168533 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 2000816 (Why is no real title available?)
• scientific article; zbMATH DE number 1903357 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• A linear algorithm for renaming a set of clauses as a Horn set
• A symbolic approach to predicate abstraction.
• AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
• Backdoors to satisfaction
• Complexity of generalized satisfiability counting problems
• Consequence finding algorithms
• Decomposable negation normal form
• Deduction in non-Horn databases
• Depth-First Search and Linear Graph Algorithms
• Formal Methods in Computer-Aided Design
• Knowledge compilation and theory approximation
• Knowledge compilation for closed world reasoning and circumscription
• Knowledge compilation with empowerment
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Models and quantifier elimination for quantified Horn formulas
• Negation as failure: careful closure procedure
• On sentences which are true of direct unions of algebras
• On the hardness of approximate reasoning
• On the relationship between circumscription and negation as failure
• Reasoning under inconsistency: a forgetting-based approach
• Recognizing disguised NR(1) instances of the satisfiability problem
• Renaming a Set of Clauses as a Horn Set
• Solution Enumeration for Projected Boolean Search Problems
• Structure identification in relational data
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The complexity of satisfiability problems
• The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
• The decision problem for some classes of sentences without quantifiers
• Theory and Applications of Satisfiability Testing
• Transformations into normal forms for quantified circuits

Cited in

(7)

• Inference engine based on closure and join operators over truth table binary relations
• Duality in Knowledge Compilation Techniques
• Precise upper and lower bounds for the monotone constraint satisfaction problem
• On the role of logical separability in knowledge compilation
• Complexity issues related to propagation completeness
• No Efficient Disjunction or Conjunction of Switch-Lists
• On quantifying literals in Boolean logic and its applications to explainable AI

This page was built for publication: Disjunctive closures for knowledge compilation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460617)