Skip to main content
SpringerLink
Log in

Extending deductive database languages by embedded implications

  • Session 4: Data Bases and Knowledge Bases
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

A bottom-up, set-oriented evaluation scheme for a deductive database query language with embedded implications is defined. An embedded implication defines a local extension of the set of rules available for answering a goal. It can therefore be viewed either as a hypothetical query or as a reference to some external program. We define an iterated fixpoint semantics for stratifiable deductive database programs with negation and embedded implications. In addition, we develop a transformation of queries and programs with embedded implications into ordinary ones. A preprocessorbased prototype compiler able to handle embedded implications has been implemented.

This work has been done while the author had a temporary appointment at the University of Passau.

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. Apt K.R., Blair H.A., Walker A.: Towards a Theory of Declarative Knowledge. in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, 1988, p. 89–149

    Google Scholar 

  2. Brogi A., Mancarella P., Pedreschi D., Turini F.: Composition Operators for Logic Theories, in J.W.Lloyd (Ed.), Computational Logic, Symp. Proc., Brussels, 1990, p. 117–134

    Google Scholar 

  3. Brogi A., Lamma E., Mello P.: Inheritance and Hypothetical Reasoning in Logic Programming. Proc. 9th European Conf. on Artificial Intelligence, 1990, p. 105–110

    Google Scholar 

  4. Chen W.: A theory of modules based on second-order logic. Proc. IEEE Symp. on Log. Progr., 1987, p. 24–33

    Google Scholar 

  5. Chen W., Kifer M., Warren D.: HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs. Proc. North American Conf. on Log. Progr., MIT Press, 1989, p. 1090–1115

    Google Scholar 

  6. Freitag B., Schütz H., Specht G.: LOLA — A Logic Language for Deductive Databases and its Implementation. Proc. 2nd Intl. Symp.on Database Systems for Advanced Applications (DASFAA '91), Tokyo, 1991, p. 216–225

    Google Scholar 

  7. Freitag B.: Module und Hypothetisches Schließen in Deduktiven Datanbanken. Ph.D. dissertation, Technische Universität München, 1991, p. 1–261

    Google Scholar 

  8. Freitag B.: A Deductive Database Language Supporting Modules. (to appear)

    Google Scholar 

  9. Gabbay D. M., Reyle U.: N-PROLOG: An Extension of PROLOG with Hypothetical Implications. I.. J.Log. Progr. 4 (1984), p. 319–355

    Google Scholar 

  10. Gabbay D. M.: N-PROLOG: An Extension of PROLOG with Hypothetical Implications. II.Logical Foundations and Negation as Failure. J. Log. Progr. 4 (1985), p. 251–283

    Google Scholar 

  11. Giordano L., Martelli A., Rossi G.: Local Definitions with Static Scope Rules in Logic Programming. Proc. Intl. Conf. on 5th Gen. Comp. Syst., 1988, p. 389–396

    Google Scholar 

  12. Giordano L., Martelli A.: A Modal Reconstruction of Blocks and Modules in Logic Programming. Proc. 1991 Intl. Symp. on Log. Progr., 1991, p. 239–253

    Google Scholar 

  13. Harland J.: A Kripke-like Model for Negation as Failure. Proc. North American Conf. on Log. Progr., Cleveland, 1989, MIT Press, 1989, p. 604–626

    Google Scholar 

  14. Hodas J., Miller D.: Representing Objects in a Logic Programming Language with Scoping Constructs. in: Logic Programming, Ed. D. Warren and P. Szeredi, Proc. 7th Intl. Conf. on Log. Progr., MIT Press, 1990, p. 511–526

    Google Scholar 

  15. Lloyd J.W.: Foundations of Logic Programming. Springer, 1987

    Google Scholar 

  16. Mello P., Natali A.: Logic Programming in a Software Engineering Perspective. Proc. North American Conf. on Log. Progr., MIT Press, 1989, p. 441–458

    Google Scholar 

  17. Miller D.: Abstract Syntax and Logic Programming. Proc. 1st and 2nd Russian Conf. on Log. Progr., Springer LNCS 1992, p. 322–337

    Google Scholar 

  18. Miller D.: A Logical Analysis of Modules in Logic Programming. J. Log. Progr. (1989) 6, p. 79–108

    Google Scholar 

  19. Monteiro L., Porto A.: Contextual Logic Programming. Proc. 6th Intl. Conf. on Log. Progr., MIT Press, 1989, p. 284–299

    Google Scholar 

  20. Nadathur G., Miller D.: An Overview of λ-Prolog. Proc. 5th Intl. Conf. on Log. Progr., MIT Press, 1988, p. 810–827

    Google Scholar 

  21. Przymusinski T.C.: On the Declarative Semantics of Deductive Databases. in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, 1988, p. 193–217

    Google Scholar 

  22. Sanella D., Wallen L.: A Calculus for the Construction of Modular Prolog Programs. J. Log. Progr. 12 (1992), p. 147–177

    Google Scholar 

Download references

Author information

Author notes

  1. Burkhard Freitag

    Present address: Institut für Informatik, Technische Universität München, Orleansstraβe 34, D-8000, München 80, Germany

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, Universität Passau, Innstraße 33, D-8390, Passau, Germany

    Burkhard Freitag

Authors
  1. Burkhard Freitag
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Burkhard Freitag .

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freitag, B. (1992). Extending deductive database languages by embedded implications. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013051

Download citation

  • DOI: https://doi.org/10.1007/BFb0013051

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation