Skip to main content
SpringerLink
Log in

Representation independent query and update operations on propositional definite Horn formulas

  • Chapter
  • First Online:
Book cover Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 270))

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Börger: Berechenbarkeit, Komplexität, Logik Vieweg, 1985

    Google Scholar 

  2. 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 

  3. R. Fagin, G.M. Kuper, J.D. Ullman, M.Y. Vardi: Updating Logical Databases Advances in Computing Research 3, 1–18 (1986)

    Google Scholar 

  4. Degi Li: A PROLOG database system Research Studies Press, 1984

    Google Scholar 

  5. J.W. Lloyd: Foundations of Logic Programming Springer, 1984

    Google Scholar 

  6. R. Reiter: A logic for default reasoning Artificial Intelligence 13, 1980

    Google Scholar 

  7. D.S. Warren: Database Updates in PROLOG Proc. of the 5th Int. Conf. on Gen. Comp. Syst. 1984

    Google Scholar 

  8. A. Weber: Updating Propositional Formulas to appear in Proc. 1st Int. Conf. Expert Database Sys. Charleston, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, D-7500, Karlsruhe, West-Germany

    Hans Kleine Büning & Theodor Lettmann

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Theodor Lettmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation