Skip to main content
SpringerLink
Log in

Universally quantified queries in languages with order-sorted logics

  • Technical Papers
  • Conference paper
  • First Online:
GWAI-92: Advances in Artificial Intelligence

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

  • 152 Accesses

Abstract

In many applications of Knowledge-Based Systems or deductive databases the user wants to be able to check whether a certain property P(x) holds globally, i.e. whether it can be derived for all the individuals in the data base. Normally knowledge representation systems or logic programming systems cannot answer such requests. In this paper we show that the taxonomy of classes available in standard knowledge representation languages allows to solve this kind of query by dividing the proof into several cases according to the subsort structure present in the knowledge base.

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. J. H. Gallier. Logic for Computer Science — Foundations of Automatic Theorem Proving. Harper & Row, New York, 1986.

    Google Scholar 

  2. O. Herzog and C.-R. Rollinger, editors. Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, volume 546 of Lecture Notes in Artifical Intelligence. Springer Verlag, Berlin, Heidelberg, 1991.

    Google Scholar 

  3. J-L. Lassez, M.J. Maher, and K. Marriott. Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann Publishers, Los Altos, 1987.

    Google Scholar 

  4. D. W. Loveland. Automated Theorem Proving: A Logical Basis North Holland, 1978.

    Google Scholar 

  5. P. Mancarella, S. Martini, and D. Pedreschi. Complete logic programs with domain-closure axiom. Journal of Logic Programming, 5:263–276, 1988.

    Article  Google Scholar 

  6. D. Miller. Lexical scoping as universal quantification. In Proc. of the 6th ICLP, 1989.

    Google Scholar 

  7. N. J. Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.

    Google Scholar 

  8. M. Schmidt-Schauß. Computational Aspects of an Order-Sorted Logic with Term Declarations. Lecture Notes in Artificial Intelligence. Springer-Verlag, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Deutschland GmbH, Postfach 10 30 68, D-6900, Heidelberg 1

    Stefan Decker & Christoph Lingenfelder

Authors
  1. Stefan Decker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Lingenfelder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Jürgen Ohlbach

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Decker, S., Lingenfelder, C. (1993). Universally quantified queries in languages with order-sorted logics. In: Jürgen Ohlbach, H. (eds) GWAI-92: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019011

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56667-0

  • Online ISBN: 978-3-540-47626-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation