Disjunctive closures for knowledge compilation

The knowledge compilation (KC) map [1] can be viewed as a multi-criteria evaluation of a number of target classes of representations for propositional KC. Using this map, the choice of a class for a given application can be made, considering both the space efficiency of it (i.e., its ability to repr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Artificial intelligence Ročník 216; s. 129 - 162
Hlavní autori: Fargier, Hélène, Marquis, Pierre
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier B.V 01.11.2014
Elsevier
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial Intelligence
Closures
Computation and Language
Computational complexity
Computer Science
Computer science; control theory; systems
Exact sciences and technology
Expert systems
Horns
Knowledge compilation
Knowledge representation
Logic in Computer Science
Logical, boolean and switching functions
Machine Learning
Polynomials
Queries
Representations
Theoretical computing
Transformations
Transformations (mathematics)
Computational complexity
Knowledge compilation
Knowledge representation
Knowledge engineering
Compilation
Closure
Horn clauses
Logical programming
Polynomial time
Multiple view
Disjunction
Efficiency
Propositional language
Satisfiability
ISSN:0004-3702, 1872-7921
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The knowledge compilation (KC) map [1] can be viewed as a multi-criteria evaluation of a number of target classes of representations for propositional KC. Using this map, the choice of a class for a given application can be made, considering both the space efficiency of it (i.e., its ability to represent information using little space), and its time efficiency, i.e., the queries and transformations which can be achieved in polynomial time, among those of interest for the application under consideration. When no class of propositional representations offers all the transformations one would expect, some of them can be left implicit. This is the key idea underlying the concept of closure introduced here: instead of performing computationally expensive transformations, one just remembers that they have to be done. In this paper, we investigate the disjunctive closure principles, i.e., disjunction, existential quantification, and their combinations. We provide several characterization results concerning the corresponding closures. We also extend the KC map with new propositional languages obtained as disjunctive closures of several incomplete propositional languages, including the well-known KROM (the CNF formulae containing only binary clauses), HORN (the CNF formulae containing only Horn clauses), and AFF (the affine language, which is the set of conjunctions of XOR-clauses). Each introduced language is evaluated along the lines of the KC map.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2014.07.004