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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ait-Kaci, H.; Nasr, R.: Login, A Logic Programming Language with Built-in Inheritance. J. Logic Programming (1986)3, 185–215
Brachman, R.J.; Schmolze, J.G.: An Overview of the KL-ONE Knowledge Representation System. Cognitive Science, Vol. 9, No. 2, April 1985
Bürckert, H-J.: Extending the Warren Abstract Machine to Many-Sorted Prolog. Memo Seki-85-VII-KL, Universität Kaiserslautern, Fachbereich Informatik, 1985
Clocksin, W.F.; Mellish, C.S.: Programming in Prolog. Second Edition. Springer-Verlag (1984)
Cohn, A.G.: Improving the Expressiveness of many-sorted Logic. AAAI-83, Washington (1983)
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
Frisch, A.M.: An investigation into inference with restricted quantification and a taxonomic representation. SIGART Newsletter 91 (1985), 28–31
Gallaire, H.; Minker,J. (eds.): Logic and Databases. Plenum Press, New York (1978)
Goguen, J.A.: Order-Sorted Algebra. Technical Report, UCLA Computer Science Department, Semantics and Theory of COmputation Report No. 14, 1978
Gogouen, J.A.; Meseguer, J.: Eglog: Equality, Types and Generic Modules for Logic Programming. J. of Logic Programming(1984)2, 179–210
Grätzer, G.: Lattice Theory. W.H. Freeman Co., (1971), pp.34 ff
Huber, M.: L-Maschine: Maschinenmodell mit Sorten. Arbeitsbericht, Universität Karlsruhe, Fakultät für Informatik, 1985 (in German)
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)
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
Lloyd, J.W.: Foundations of Logic Programming. (1984) Springer-Verlag
Schmidt-Schauss, M.: Mechanical Generation of Sorts in Clause Sets. Memo-Seki-85-IV-KL, Fachbereich Informatik, Universität Kaiserslautern, 1985
Schmidt-Schauss, M.: A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. Proc. 9th IJCAI (1985) W. Kaufmann
Smolka, G.: Order-Sorted Horn Logic: Semantics and Deduction. SEKI-Report SR-86–17, October 1986, Universität Kaiserslautern, Fachbereich Informatik, 1986
Smolka, G.; Ait-Kaci, H.: Inheritance Hierarchies: Semantics and Unification. MCC Technical Report M-057–87, 1987
Walther, C.: A Many-Sorted Calculus Based on Resolution and Paramodulation. Proc. of the 8th IJCAI, Karlsruhe (1983) W. Kaufman, 882–891
Walther, C.: A mechanical solution of Schubert’s Steamroller by many-sorted resolution. J. of Artificial Intelligence 26, 2 (1985)
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)
Warren, D.H.D.: An Abstract Prolog Instruction Set. SRI Technical Report 309, 1983
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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