Abstract
In this paper we study query and update operations for databases consisting of propositional clauses in definite Horn form. We assume that the operations are independent of the given form of the formula, i.e. operations applied to equivalent formulas result equivalent formulas. In order to estimate the required space and time we prove complexity bounds for each of the introduced operations. Finally our considerations are applied to so called interactive formulas, which are often found in knowledge bases of Expert systems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Börger: Berechenbarkeit, Komplexität, Logik Vieweg, 1985
R. Fagin, J.D. Ullman, M.Y. Vardi: On the Semantics of Updates in Databases Proc 2nd ACM Symp on the Principles of Database Systems, 352–365 (1983)
R. Fagin, G.M. Kuper, J.D. Ullman, M.Y. Vardi: Updating Logical Databases Advances in Computing Research 3, 1–18 (1986)
Degi Li: A PROLOG database system Research Studies Press, 1984
J.W. Lloyd: Foundations of Logic Programming Springer, 1984
R. Reiter: A logic for default reasoning Artificial Intelligence 13, 1980
D.S. Warren: Database Updates in PROLOG Proc. of the 5th Int. Conf. on Gen. Comp. Syst. 1984
A. Weber: Updating Propositional Formulas to appear in Proc. 1st Int. Conf. Expert Database Sys. Charleston, 1986
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Büning, H.K., Lettmann, T. (1987). Representation independent query and update operations on propositional definite Horn formulas. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_167
Download citation
DOI: https://doi.org/10.1007/3-540-18170-9_167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18170-5
Online ISBN: 978-3-540-47795-2
eBook Packages: Springer Book Archive