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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Boufkhad. Algorithms for Propositional KB Approximation. In Proc. National Conference on AI (AAAI’ 98), Madison, Wisconsin, pp. 280–285, July 26–30 1998.
M. Cadoli. Semantical and Computational Aspects of Horn Approximations. In Proc. IJCAI-93, pp. 39–44, 1993.
W. Dowling and J. H. Gallier. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Theories. J. Logic Programming, 3:267–284, 1984.
T. Eiter, T. Ibaraki, and K. Makino. Computing Intersections of Horn Theories for Reasoning with Models. In: Proc. AAAI’ 98, pp. 292–297, 1998.
T. Eiter, T. Ibaraki, and K. Makino. Disjunctions of Horn Theories and their Cores. In Proc. 9th Int’l Symp. on Algorithms and Computation (ISAAC)’ 98, Dec. 1998.
T. Eiter, T. Ibaraki, and K. Makino. On the Difference of Horn Theories. RUTCOR Research Report RRR 25-98, Rutgers University 1998.
G. Gogic, C. Papadimitriou, and M. Sideri. Incremental Recompilation of Knowledge. J. Artificial Intelligence Research, 8:23–37, 1998.
D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On Generating All Maximal Independent Sets. Information Processing Letters, 27:119–123, 1988.
H. Katsuno and A. O. Mendelzon. Propositional Knowledge Base Revision and Minimal Change. Artificial Intelligence, 52:253–294, 1991.
H. Kautz, M. Kearns, and B. Selman. Reasoning With Characteristic Models. In Proc. AAAI’ 93, 1993.
H. Kautz and B. Selman. Knowledge Compilation and Theory Approximation. JACM, 43(2):193–224, 1996.
D. Kavvadias, C. Papadimitriou, and M. Sideri. On Horn Envelopes and Hypergraph Transversals. In Proc. ISAAC’ 93, LNCS 762, pp. 399–405, 1993.
R. Khardon and D. Roth. Reasoning with Models. Art. Intelligence, 87(1/2):187–213, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Ibaraki, T., Makino, K. (1999). On the Difference of Horn Theories. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive