Representation independent query and update operations on propositional definite Horn formulas
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.
Unable to display preview. Download preview PDF.
- [Bör85]E. Börger: Berechenbarkeit, Komplexität, Logik Vieweg, 1985Google Scholar
- [Fag83]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)Google Scholar
- [Fag86]R. Fagin, G.M. Kuper, J.D. Ullman, M.Y. Vardi: Updating Logical Databases Advances in Computing Research 3, 1–18 (1986)Google Scholar
- [Li84]Degi Li: A PROLOG database system Research Studies Press, 1984Google Scholar
- [Llo84]J.W. Lloyd: Foundations of Logic Programming Springer, 1984Google Scholar
- [Rei80]R. Reiter: A logic for default reasoning Artificial Intelligence 13, 1980Google Scholar
- [War84]D.S. Warren: Database Updates in PROLOG Proc. of the 5th Int. Conf. on Gen. Comp. Syst. 1984Google Scholar
- [Web85]A. Weber: Updating Propositional Formulas to appear in Proc. 1st Int. Conf. Expert Database Sys. Charleston, 1986Google Scholar