Skip to main content
SpringerLink
Log in

Taxonomical Reasoning in Logic Programming

  • Conference paper
3. Österreichische Artificial-Intelligence-Tagung

Part of the book series: Informatik-Fachberichte ((2252,volume 151))

  • 37 Accesses

Abstract

An extension of the PROLOG language is described which supports taxonomical reasoning on the grounds of order-sorted SLD-resolution. Taxonomical information, expressed through sorts and subsort relations, is strictly distinguished from the program. Nonetheless, declarative semantics and related properties can be expressed within the framework of untyped definite clauses. Our Extended Prolog with Order-Sorted resolution (EPOS) supports data abstraction and inheritance mechanisms and offers an enhanced language expressiveness resulting in shorter programs. Compared to PROLOG, more efficient computations are obtained since taxonomical reasoning is effected during unification rather than by resolution. Examples and comparative performance figures are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ait-Kaci, H.; Nasr, R.: Login, A Logic Programming Language with Built-in Inheritance. J. Logic Programming (1986)3, 185–215

    Article  Google Scholar 

  2. Brachman, R.J.; Schmolze, J.G.: An Overview of the KL-ONE Knowledge Representation System. Cognitive Science, Vol. 9, No. 2, April 1985

    Google Scholar 

  3. Bürckert, H-J.: Extending the Warren Abstract Machine to Many-Sorted Prolog. Memo Seki-85-VII-KL, Universität Kaiserslautern, Fachbereich Informatik, 1985

    Google Scholar 

  4. Clocksin, W.F.; Mellish, C.S.: Programming in Prolog. Second Edition. Springer-Verlag (1984)

    Google Scholar 

  5. Cohn, A.G.: Improving the Expressiveness of many-sorted Logic. AAAI-83, Washington (1983)

    Google Scholar 

  6. Fikes,R.E.; Kehler,T.P.: The Role of Frame-Based Representation in Reasoning. in Communications of the ACM special issue on Knowledge-Based Systems, Sept. 1985

    Google Scholar 

  7. Frisch, A.M.: An investigation into inference with restricted quantification and a taxonomic representation. SIGART Newsletter 91 (1985), 28–31

    Google Scholar 

  8. Gallaire, H.; Minker,J. (eds.): Logic and Databases. Plenum Press, New York (1978)

    Google Scholar 

  9. Goguen, J.A.: Order-Sorted Algebra. Technical Report, UCLA Computer Science Department, Semantics and Theory of COmputation Report No. 14, 1978

    Google Scholar 

  10. Gogouen, J.A.; Meseguer, J.: Eglog: Equality, Types and Generic Modules for Logic Programming. J. of Logic Programming(1984)2, 179–210

    Article  Google Scholar 

  11. Grätzer, G.: Lattice Theory. W.H. Freeman Co., (1971), pp.34 ff

    Google Scholar 

  12. Huber, M.: L-Maschine: Maschinenmodell mit Sorten. Arbeitsbericht, Universität Karlsruhe, Fakultät für Informatik, 1985 (in German)

    Google Scholar 

  13. Huber, M., Varsek, I.: EPOS - Extended Prolog with Order-Sorted Resolution. Interner Bericht Nr. 5/87, Fakultät für Informatik, Universität Karlsruhe (1987)

    Google Scholar 

  14. Irani, K.B.; Shin, D.G.: A Many-Sorted Resolution Based on an Extension of a First-Order Language. Proc. 9th MAI (1985) W. Kaufmann

    Google Scholar 

  15. Lloyd, J.W.: Foundations of Logic Programming. (1984) Springer-Verlag

    Book  MATH  Google Scholar 

  16. Schmidt-Schauss, M.: Mechanical Generation of Sorts in Clause Sets. Memo-Seki-85-IV-KL, Fachbereich Informatik, Universität Kaiserslautern, 1985

    Google Scholar 

  17. Schmidt-Schauss, M.: A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. Proc. 9th IJCAI (1985) W. Kaufmann

    Google Scholar 

  18. Smolka, G.: Order-Sorted Horn Logic: Semantics and Deduction. SEKI-Report SR-86–17, October 1986, Universität Kaiserslautern, Fachbereich Informatik, 1986

    Google Scholar 

  19. Smolka, G.; Ait-Kaci, H.: Inheritance Hierarchies: Semantics and Unification. MCC Technical Report M-057–87, 1987

    Google Scholar 

  20. Walther, C.: A Many-Sorted Calculus Based on Resolution and Paramodulation. Proc. of the 8th IJCAI, Karlsruhe (1983) W. Kaufman, 882–891

    Google Scholar 

  21. Walther, C.: A mechanical solution of Schubert’s Steamroller by many-sorted resolution. J. of Artificial Intelligence 26, 2 (1985)

    MathSciNet  Google Scholar 

  22. Walther, C.: Many-Sorted Calculus based on Resolution and Paramodulation. Research Notes in Artificial Intelligence (1987) Pitman Publ., Ltd., London, and Morgan Kaufmann Publ., Inc., Los Altos (forthcoming)

    Google Scholar 

  23. Warren, D.H.D.: An Abstract Prolog Instruction Set. SRI Technical Report 309, 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sonderforschungsbereich 314, Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, D-7500, Karlsruhe 1, Germany

    I. Varsek

Authors
  1. I. Varsek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Medizinische Kybernetik und Artificial Intelligence, Universität Wien, Freyung 6/2, A-1010, Wien, Österreich

    Ernst Buchberger

  2. Siemens AG Österreich, Göllnergasse 15, A-1030, Wien, Österreich

    Johannes Retti

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Varsek, I. (1987). Taxonomical Reasoning in Logic Programming. In: Buchberger, E., Retti, J. (eds) 3. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46620-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46620-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18384-6

  • Online ISBN: 978-3-642-46620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation