Skip to main content
SpringerLink
Log in

U-log, an ordered sorted logic with typed attributes

  • Session: Extension Of Logic Programming
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1991)

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

Abstract

We extend Aït-Kaci ψ-term theory by constraining the type of arguments through an “assorted” signature. A new glb is defined, based on a “filtration” function which terminates under certain conditions. We obtain a lower lattice of “filters” with a type semantics. We introduce an equivalence relation among filters and obtain a lower lattice of “equi-filters” which has a more natural partial order and semantics. We define a constructive semantics of a Prolog extension to filters, adapted from Huet's explanation of Prolog as a polymorphic type inference system. Inference is represented by three filters, thus allowing meta-reasoning.

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.

7 References

  1. Aït-Kaci & P. Lincoln: “LIFE, A Natural Language for Natural Language”, MCC Technical Report Number ACA-ST-074-88, Austin, February 1988.

    Google Scholar 

  2. Aït-Kaci & R. Nasr: “LOGIN: A Logic Programming Language with Built-in Inheritance”, Journal of Logic Programming 3(3), pp. 187–215, 1986.

    Google Scholar 

  3. J.M. Andreoli & R. Pareschi, “Linear Objects: Logical Processes with Builtin Inheritance”, in 9th Conference on Logic Programming, Jerusalem, Israel, 1990.

    Google Scholar 

  4. T. Conrad, “Equator: A Many-Sorted PROLOG Based on Equational Unification”, pp. 171–183, Actes du 7ème Séminaire de Programmation en Logique, CNET, Mai 1988.

    Google Scholar 

  5. T. Conrad, “Termes Typés et Termes Globaux”, pp. 119–130, Actes du 6ème Séminaire de Programmation en Logique, CNET, Mai 1987.

    Google Scholar 

  6. M. Dincbas, “Le Système de Résolution de Problèmes Metalog”, Rapport 3146/Deri, C.E.R.T. Toulouse 1979.

    Google Scholar 

  7. J. Dorre & W.C. Rounds, “On Subsumption and Semi-Unification in Feature Algebras”, in Proc. of the Fifth Symposium on Logic in Computer Science, 1990.

    Google Scholar 

  8. H. Gallaire, “Multiple Reasoning Styles in Logic Programming”, in Proceedings of FGCS'88 Conference (ICOT), Tokyo, 1988.

    Google Scholar 

  9. M. Gandriau & C. Massoutie, “Classes et Types: Aides à la Programmation Logique”, pp. 57–69, Actes du 8ème Séminaire de Programmation en Logique, CNET, Mai 1989.

    Google Scholar 

  10. P.Y. Gloess, “U-Log, an Ordered sorted Logic with Typed Attributes (Extended Version)”, Report No91/12/DI, Université de Technologie de Compiègne, June 1991.

    Google Scholar 

  11. P.Y. Gloess, “Contribution à l'Optimisation de Mécanismes de Raisonnement dans des Structures Spécialisées de Représentation des Connaissances”, Thèse de Doctorat d'Etat, Université de Technologie de Compiègne, 22 Janvier 90.

    Google Scholar 

  12. G. Huet, “Deduction and Computation”, Rapport de Recherche INRIA No513, Avril 1986.

    Google Scholar 

  13. J-P. Jouannaud & C. Kirchner, “Solving Equations in Abstract Algebras: a Rule-Based Survey of Unification”, L.R.I. Research Report No561, Université d'Orsay ParisXI, March 1990.

    Google Scholar 

  14. C. Kirchner, “Order-Sorted Equational Unification”, Rapport de Recherche INRIA No954, Décembre 1988.

    Google Scholar 

  15. F. Mellender, “An Integration of Logic and Object-Oriented Programming”, pp. 181–185, SIGPLAN Notices, Vol. 23, No10, 1988.

    Google Scholar 

  16. M. Schmidt-Schauß, “Computational Aspects of an Order Sorted Logic with Term Declarations”, Lectures Notes in Artificial Intelligence, Vol. 395, Springer-Verlag, ISBN 3-540-51705-7 and 0-387-517-05-7, 1989.

    Google Scholar 

  17. G. Smolka & H. Aït-Kaci, “Inheritance Hierarchies: Semantics and Unification”, to appear in Journal of Symbolic Computation, Special Issue on Unification, C. Kirchner, Ed., March 1989.

    Google Scholar 

  18. G.L. Steele Jr., “Common LISP: The Language, Digital Press”, ISBN 0-932376-41-X, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Technologie de Compiègne, B.P.649, 60206, Compiègne, France

    Paul Y Gloess

  2. U.R.A. C.N.R.S. No 817, Heuristique et Diagnostic des Systèmes Complexes, France

    Paul Y Gloess

Authors
  1. Paul Y Gloess
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Maluszyński Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gloess, P.Y. (1991). U-log, an ordered sorted logic with typed attributes. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-54444-5_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54444-9

  • Online ISBN: 978-3-540-38362-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation