Disjunctive closures for knowledge compilation

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Consequence finding algorithms
Depth-First Search and Linear Graph Algorithms
Backdoors to Satisfaction
Solution Enumeration for Projected Boolean Search Problems
Renaming a Set of Clauses as a Horn Set
The complexity of satisfiability problems
Knowledge compilation and theory approximation
Theory and Applications of Satisfiability Testing
Complexity of generalized satisfiability counting problems
On the hardness of approximate reasoning
The decision problem for some classes of sentences without quantifiers
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
On sentences which are true of direct unions of algebras
Decomposable negation normal form
On the relationship between circumscription and negation as failure
Structure identification in relational data
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Negation as failure: careful closure procedure
A linear algorithm for renaming a set of clauses as a Horn set
Deduction in non-Horn databases
Knowledge compilation for closed world reasoning and circumscription
Knowledge Compilation with Empowerment
Transformations into Normal Forms for Quantified Circuits
Recognizing disguised NR(1) instances of the satisfiability problem
Formal Methods in Computer-Aided Design
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
Computer Aided Verification
Models and quantifier elimination for quantified Horn formulas
Reasoning under inconsistency: a forgetting-based approach

Cited In (5)

Inference engine based on closure and join operators over truth table binary relations
On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
On the role of logical separability in knowledge compilation
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem
No Efficient Disjunction or Conjunction of Switch-Lists

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)