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...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 216; pp. 129 - 162
Main Authors:	Fargier, Hélène, Marquis, Pierre
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.11.2014 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!