Disjunctive closures for knowledge compilation
type: Item
instance of: scholarly article
title: Disjunctive closures for knowledge compilation
zbMATH Open document ID: 1405.68375
author: Hélène Fargier
author: Pierre Marquis
published in: Artificial Intelligence
publication date: 2014-10-13T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6354999
zbMATH Keywords: knowledge representation
zbMATH Keywords: knowledge compilation
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.artint.2014.07.004
OpenAlex ID: W1973641462
cites work: Q4411139
cites work: Knowledge compilation and theory approximation
cites work: Decomposable negation normal form
cites work: Q3624169
cites work: Knowledge Compilation with Empowerment
cites work: The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
cites work: On sentences which are true of direct unions of algebras
cites work: The complexity of satisfiability problems
cites work: Renaming a Set of Clauses as a Horn Set
cites work: Transformations into Normal Forms for Quantified Circuits
cites work: A linear algorithm for renaming a set of clauses as a Horn set
cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
cites work: The decision problem for some classes of sentences without quantifiers
cites work: Structure identification in relational data
cites work: Q4397012
cites work: Reasoning under inconsistency: a forgetting-based approach
cites work: Q5593816
cites work: Theory and Applications of Satisfiability Testing
cites work: Formal Methods in Computer-Aided Design
cites work: Solution Enumeration for Projected Boolean Search Problems
cites work: Computer Aided Verification
cites work: Q4804900
cites work: On the relationship between circumscription and negation as failure
cites work: Deduction in non-Horn databases
cites work: Q3939270
cites work: Negation as failure: careful closure procedure
cites work: Knowledge compilation for closed world reasoning and circumscription
cites work: Backdoors to Satisfaction
cites work: Q5528627
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Recognizing disguised NR(1) instances of the satisfiability problem
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q3815282
cites work: Complexity of generalized satisfiability counting problems
cites work: On the hardness of approximate reasoning
cites work: Consequence finding algorithms
cites work: Q4434165
cites work: Models and quantifier elimination for quantified Horn formulas
DOI: 10.1016/J.ARTINT.2014.07.004
description: scientific article; zbMATH DE number 6354999