Name
Abstract | ||
|---|---|---|
In this paper, we consider computing the difference between two Horn theories. This problem may arise, for example, if we take care of a theory change in a knowledge base. In general, the difference of Horn theories is not Horn. Therefore, we consider Horn approximations of the difference in terms of Horn cores (i.e., weakest Horn theories included in the difference). We study the problem under the familiar representation of Horn theories by Horn CNFs, as well as under the recently proposed model-based representation in terms of the characteristic models. For all problems and representations, polynomial time algorithms or proofs of intractability for the propositional case are provided. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/jcss.2000.1719 | Journal of Computer and System Sciences |
Keywords | DocType | Volume |
horn approximation,dierence of horn theories,horn theory,knowledge compilation,model-based representation,horn core,characteristic model,familiar representation,computational issues in ai,weakest horn theory,knowledge base,polynomial time algorithm,horn cnfs | Conference | 61 |
Issue | ISSN | ISBN |
3 | Journal of Computer and System Sciences | 3-540-65691-X |
Citations | PageRank | References |
1 | 0.37 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Eiter | 1 | 7238 | 532.10 |
| Toshihide Ibaraki | 2 | 2593 | 385.64 |
| Kazuhisa Makino | 3 | 1088 | 102.74 |