Distributed disjunctions for LIFE

  • Rolf Backofen
  • Lutz Euler
  • Günther Görz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)


PC-Life, a dialect of the LIFE language designed by Aït-Kaci, extends the original design by some features, the most important of which are distributed disjunctions. LIFE integrates the functional and the logic-oriented programming styles, and feature types supporting inheritance. This language is well suited for knowledge representation, in particular for applications in computational linguistics.


Knowledge representation AI software inferences natural language processing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Harold Abelson and Gerald Jay Sussmann. Structure and Interpretation of Computer Programs. MIT Press, 1985.Google Scholar
  2. [2]
    Hassan Aït-Kaci. An algebraic semantics approach to the effective resolution of type equations. Theoretical Computer Science, 45:293–351, 1986.CrossRefGoogle Scholar
  3. [3]
    Hassan Aït-Kaci et al. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115–146, 1989.CrossRefGoogle Scholar
  4. [4]
    Hassan Aït-Kaci and Patrick Lincoln. LIFE — a natural language for natural language. Technical report, Microelectronics and Computer Technology Corporation, Austin (TX), February 1988.Google Scholar
  5. [5]
    Hassan Aït-Kaci and Andreas Podelski. Is there a meaning to LIFE? Paper submitted to ICLP-91, November 1990Google Scholar
  6. [6]
    Hassan Aït-Kaci and Roger Nasr. Login: A logic programming language with built-in inheritance. The Journal of Logic Programming, 3:185–215, 1986.CrossRefGoogle Scholar
  7. [7]
    Rolf Backofen and Lutz Euler and Günther Görz. Towards the Integration of Functions, Relations and Types in an AI Programming Language. In Proceedings of the German Workshop on Artificial Intelligence GWAI-90, Berlin: Springer, 1990.Google Scholar
  8. [8]
    Rolf Backofen. Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen. Diplomarbeit, Universität Erlangen-Nürnberg, 1989.Google Scholar
  9. [9]
    Jochen Dörre and Andreas Eisele. Determining consistency of feature terms with distributed disjunctions. In D[ieter] Metzing, editor, Proc. of the 13 th German Workshop on Artificial Intelligence, volume 216 of Informatik Fachberichte, pages 270–279. Springer, Berlin, 1989.Google Scholar
  10. [10]
    Andreas Eisele and Jochen Dörre. Unification of disjunctive feature descriptions. In 26th Annual Meeting of the Association for Computational Linguistics, pages 186–194, Buffalo (NY), 1988.Google Scholar
  11. [11]
    Lutz Euler. Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil I: Konzeption, Typhierarchie und Funktionen. Diplomarbeit, Universität Erlangen-Nürnberg, 1989.Google Scholar
  12. [12]
    Christopher T. Haynes. Logic continuations. Journal of Logic Programming, 4:157–176, 1987.CrossRefGoogle Scholar
  13. [13]
    John Maxwell and Ronald Kaplan. An overview of disjunctive constraint satisfaction. In Proceedings of the International Parsing Workshop 1989, pages 18–27, 1989.Google Scholar
  14. [14]
    Bernhard Nebel and Gert Smolka. Representation and reasoning with attributive descriptions. IWBS-Report 81, IBM Deutschland GmbH, Stuttgart, 1989.Google Scholar
  15. [15]
    Gert Smolka. A feature logic with subsorts. LILOG-Report 33, IBM Deutschland GmbH, Stuttgart, May 1988.Google Scholar
  16. [16]
    Åke Wikström. Functional Programming Using Standard ML. Prentice Hall, London, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Rolf Backofen
    • 1
  • Lutz Euler
    • 2
  • Günther Görz
    • 3
  1. 1.DFKI GmbHSaarbrücken
  2. 2.Fachbereich Informatik-NatSUniversität HamburgGermany
  3. 3.Informatik 8-KIUniversität Erlangen-NürnbergGermany

Personalised recommendations