Paper Info
Title
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Abstract
Selman and Kautz introduced the notion of approximation of a theory and showed its usefulness for knowledge compilation and on-line reasoning. We study here the complexity of the main computational problems related to the approximation of relations (sets of possible worlds) by propositional formulas, and the semantics of reasoning with these approximations (deduction and abduction). The classes of formulas that we consider are those of (reverse-)Horn, bijunctive and affine formulas, which are the most interesting for storing knowledge.Concerning the computation of approximations, we survey and complete the results that can be found in the literature, trying to adopt a unified point of view. On the contrary, as far as we know this paper is the first real attempt to study the semantics of abduction with the bounds of a theory.
Year
DOI
Venue
2002
10.1007/3-540-45622-8_18
SARA
Keywords
Field
DocType
propositional formulas,main computational problem,on-line reasoning,affine formula,propositional formula,knowledge compilation,real attempt,storing knowledge,unified point,possible world,possible worlds
Discrete mathematics,Knowledge representation and reasoning,Computational problem,Computer science,Knowledge compilation,Conjunctive normal form,Propositional variable,Propositional formula,Computational complexity theory,Possible world
Conference
ISBN
Citations 
PageRank 
3-540-43941-2
6
0.51
References 
Authors
18
1
Name
Order
Citations
PageRank
Bruno Zanuttini128925.43