References

AK86

Hassan Aït-Kaci. An algebraic semantics approach to the effective resolution of type equations. Theoretical Computer Science, 45:293--351, 1986.

AK93

Hassan Aït-Kaci. An introduction to LIFE --- programming with logic, inheritance, functions and equations. In Dale Miller, editor, Proc. of the International Symposium on Logic Programming, pages 52--68, Vancouver, October 1993. MIT Press.

AKLN87

Hassan Aït-Kaci, Patrick Lincoln, and Roger Nasr. Le Fun: Logic, equations, and functions. In Proceedings of the 1987 Symposium on Logic Programming, pages 17--23. IEEE Computer Society, 1987.

AKN86

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.

AKN89

Hassan Aït-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

AKP93

Hassan Aït-Kaci and Andreas Podelski. Towards a meaning of LIFE. The Journal of Logic Programming, 16:195--234, 1993.

AKPG93

Hassan Aït-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. In Dale Miller, editor, Proc. of the International Symposium on Logic Programming, pages 506--524, Vancouver, October 1993. MIT Press.

AKPS94

Hassan Aït-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1--2):263--283, January 1994.

Bac89

Rolf Backofen. Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen. Master's thesis, Universität Erlangen-Nürnberg, 1989.

Bac94

Rolf Backofen. Regular path expressions in feature logic. Journal of Symbolic Computation, 17:412--455, 1994.

Bac95a

Rolf Backofen. A complete axiomatization of a theory with feature and arity constraints. The Journal of Logic Programming, 1995. To appear.

Bac95b

Rolf Backofen. Type systems and definite equivalences. Forthcoming, 1995.

BBN93

Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, and Gert Smolka. On the expressivity of feature logics with negation, functional uncertainty, and sort equations. Journal of Logic, Language and Information, 2:1--18, 1993.

BEG90

Rolf Backofen, Lutz Euler, and Günther Görz. Towards the integration of functions, relations and types in an AI programming language. In Heinz Marburger, editor, Proc. of the 14 German Workshop on Artificial Intelligence, volume 251 of Informatik Fachberichte, pages 297--306. Springer, Berlin, 1990.

BK93

Rolf Backofen and Hans-Ulrich Krieger. The / system. In Rolf Backofen, Hans-Ulrich Krieger, Stephen P. Spackman, and Hans Uszkoreit, editors, Report of the EAGLES Workshop on Implemented Formalisms at DFKI, Saarbrücken, pages 67--74, 1993. DFKI Document D-93-27.

BKSU93

Rolf Backofen, Hans-Ulrich Krieger, Stephen P. Spackman, and Hans Uszkoreit, editors. Report of the EAGLES Workshop on Implemented Formalisms at DFKI, Saarbrücken, 1993. DFKI Document D-93-27.

BS93a

Rolf Backofen and Gert Smolka. A complete and recursive feature theory. In Proc. of the 31 Annual Meeting of the Association for Computational Linguistics, pages 193--200, Columbus, Ohio, 1993. Full version has appeared as Research Report RR-92-30, DFKI, Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany, and will appear in Theoretical Computer Science.

BS93b

Patrick Blackburn and Edith Spaan. A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language and Information, 2:129--169, 1993.

BT94

Rolf Backofen and Ralf Treinen. How to win a game with features. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 320--335, München, Germany, 7--9 September 1994. Springer-Verlag.

Car92

Bob Carpenter. The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1992.

Car94

Bob Carpenter. Ale: The attribute logic engine. user's guide, version . Technical report, Carnegie--Mellon University, Pittsburgh, PA 15213, 1994.

CL89

Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371--425, 1989.

Cla78

K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293--322. Plenum Press, New York, NY, 1978.

DD93

Jochen Dörre and Michael Dorna. CUF -- a formalism for linguistic knowledge representation. In Jochen Dörre, editor, Computational Aspects of Constraint-Based Linguistic Descriptions, pages 1--22, 1993. DYANA Deliverable R1.2.A.

DE89

Jochen Dörre and Andreas Eisele. Determining consistency of feature terms with distributed disjunctions. In Dieter Metzinger, editor, Proc. of the 13 German Workshop on Artificial Intelligence, volume 216 of Informatik Fachberichte, pages 270--279. Springer, Berlin, 1989.

DE90

Jochen Dörre and Andreas Eisele. Feature logic with disjunctive unification. In Proc. of the 13 International Conference on Computational Linguistics, pages 100--105, Helsinki, Finland, 1990.

DE91

Jochen Dörre and Andreas Eisele. A comprehensive unification-based grammar formalism. Deliverable R3.1.B, DYANA --- ESPRIT Basic Research Action BR3175, Centre for Cognitive Science, University of Edinburgh, January 1991.

Der87

Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69--116, 1987.

Eur94

European Community. EAGLES Interim Report, 1994. draft.

EZ90a

Martin Emele and Rémi Zajac. A fixed-point semantics for feature type systems. In Stéphane Kaplan and Mitsuhiro Okada, editors, Conditional and Typed Rewriting Systems, 2nd International Workshop, LNCS 516, pages 383--388, Montreal, Canada, June 11--14, 1990. Springer-Verlag.

EZ90b

Martin Emele and Rémi Zajac. Typed unification grammars. In Proc. of the 13 International Conference on Computational Linguistics, pages 293--298, Helsinki, Finland, 1990.

HS88

Markus Höhfeld and Gert Smolka. Definite relations over constraint languages. LILOG-Report 53, IBM Deutschland GmbH, Stuttgart, October 1988.

HSW93

Martin Henz, Gert Smolka, and Jörg Würtz. Oz---a programming language for multi-agent systems. In Ruzena Bajcsy, editor, 13th International Joint Conference on Artificial Intelligence, volume 1, pages 404--409, Chambéry, France, 1993. Morgan Kaufmann Publishers.

HSW95

Martin Henz, Gert Smolka, and Jörg Würtz. Object-oriented concurrent constraint programming in Oz. In V. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming, chapter 2, pages 27--48. The MIT Press, Cambridge, MA, 1995. To appear.

JL87

J. Jaffar and J.-L. Lassez. Constraint logic programming. In Principles of Programming Languages, pages 111--119, 1987.

Joh88

Mark Johnson. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, 1988.

Joh91

Mark Johnson. Features and formulae. Computational Linguistics, 17(2):131--151, 1991.

Joh94

Mark Johnson. Computing with features as formulae. Computational Linguistics, 20(1):1--25, 1994.

Kay79

Martin Kay. Functional grammar. In C. Chiarello et al., editor, Proceedings of the 5th Annual Meeting of the Berkeley Linguistics Society, pages 142--158, Berkeley, CA, 1979.

KB82

Ronald M. Kaplan and Joan Bresnan. Lexical-Functional Grammar: A formal system for grammatical representation. In J. Bresnan, editor, The Mental Representation of Grammatical Relations, pages 173--381. MIT Press, Cambridge (MA), 1982.

KM88

R. M. Kaplan and J. T. Maxwell III. An algorithm for functional uncertainty. In Proceedings of the 12th International Conference on Computational Linguistics, pages 297--302, Budapest, Hungary, 1988.

KR86

Robert T. Kasper and William C. Rounds. A logical semantics for feature structures. In Proceedings of the 24th Annual Meeting of the ACL, Columbia University, pages 257--265, New York, N.Y., 1986.

KR90

Ropert T. Kasper and William C. Rounds. The logic of unification grammar. Lingusitic and Philosophy, 13:35--58, 1990.

Kri95

Hans-Ulrich Krieger. ---A Type Description Language for Constraint-Based Grammars. Foundations, Implementation, and Applications. PhD thesis, Universität des Saarlandes, 1995. Forthcoming.

KS94

Hans-Ulrich Krieger and Ulrich Schäfer. ---a type description language for constraint-based grammars. In Proceedings of the 15th International Conference on Computational Linguistics, COLING-94, pages 893--899, Kyoto, Japan, 1994.

KZ88

Ronald M. Kaplan and Annie Zaenen. Long-distance dependencies, constituent structure, and functional uncertainty. In M. Baltin and A. Kroch, editors, Alternative Conceptions of Phrase Structure. University of Chicago Press, Chicago, 1988.

Mah88

Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, pages 348--457, Edinburgh, Scotland, July 1988.

MAK90

Richard Meyer and Hassan Ait-Kaci. Wild-life, a user manual. Technical Note 1, Digital Equipment Corporation, November 1990.

Man93

Suresh Manandhar. Cuf in context. In Jochen Dörre, editor, Computational Aspects of Constraint-Based Linguistic Descriptions, pages 45--53, 1993. DYANA Deliverable R1.2.A.

MK89

John Maxwell and Roland Kaplan. An overview over disjunctive constraint satisfaction. In Proceedings of the International Parsing Workshop 1989, pages 18--27, 1989.

Mos92

Lawrence S. Moss. Completeness theorems for logics of feature structures. In Y. N. Moschovakis, editor, Logic from Computer Science, pages 387--403, Berlin, Heidelberg, New York, 1992. Springer-Verlag.

Per83

Fernando C.N. Pereira. Parsing as deduction. In Proceedings of the 21th Annual Meeting of the Association for Computational Linguistics, pages 137--144, Cambridge, MA, 1983.

PM90

Carl J. Pollard and M. Drew Moshier. Unifying partial descriptions of sets. In P. Hanson, editor, Information, Language, and Cognition. Vol. 1 of Vancouver Studies in Cognitive Science, pages 285--322. University of British Columbia Press, 1990.

Pol89

Carl Pollard. Sorts in unification-based grammar and what they mean. Unpublished manuscript, 1989.

PS87

Carl Pollard and Ivan A. Sag. Information-Based Syntax and Semantics. Vol. 1: Fundamentals, volume 13 of CSLI Lecture Notes. Chicago Univ. Press, Chicago, 1987.

PS94

Carl Pollard and Ivan A. Sag. Head-Driven Phrase Structure Grammar. Studies in Contemporary Linguistics. University of Chicago Press, Chicago, 1994.

Rea91

Mike Reape. An introduction to the semantics of unification-based grammar formalisms. Deliverable R3.2.A, DYANA, Centre for Cognitive Science, University of Edinburgh, January 1991.

RJ94

C. J. Rupp and Rod Johnson. On the portability of complex constraint-based grammars. In Proc. of the 15 International Conference on Computational Linguistics, pages 900--905, Kyoto, Japan, 1994.

RK86

William C. Rounds and Robert Kasper. A complete logical calculus for record structures representing linguistic information. In Proc. of the Symposium on Logic in Computer Sciences, pages 38--43, Cambridge (MA), 1986. IEEE Computer Society.

Sar91

Vijay A. Saraswat. Semantic foundation of concurrent constraint programming. In Principles of Programming Languages, pages 333--352, 1991.

Shi86

Stuart M. Shieber. An Introduction to Unification-Based Approaches to Grammar, volume 4 of CSLI Lecture Notes. Stanford University, Stanford (CA), 1986.

Shi89

Stuart M. Shieber. Parsing and type inference for natural and computer languages. Technical Note 460, SRI International, Menlo Park, MA, March 1989.

Shi92

Stuart M. Shieber. Constraint-Based Grammar Formalisms. MIT - Press, Cambridge, Massachusetts - London, 1992.

Smo88

Gert Smolka. A feature logic with subsorts. LILOG-Report 33, IWBS, IBM Deutschland, Stuttgart, May 1988.

Smo92

Gert Smolka. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51--87, 1992.

Smo93

Gert Smolka. Logische Programmierung. Lecture Notes (in German), 1993.

Smo94a

Gert Smolka. A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-94-03, DFKI, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, February 1994.

Smo94b

Gert Smolka. The definition of Kernel Oz. DFKI Oz documentation series, DFKI, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1994.

Smo94c

Gert Smolka. A foundation for higher-order concurrent constraint programming. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 50--72, München, Germany, 7--9 September 1994. Springer-Verlag.

Smo94d

Gert Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1994.

SR90

Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 232--245, San Francisco, CA, January 1990.

ST94

Gert Smolka and Ralf Treinen. Records for logic programming. The Journal of Logic Programming, 18(3):229--258, April 1994.

SUP83

Stuart Shieber, Hans Uszkoreit, Fernando Pereira, Jane Robinson, and Mabry Tyson. The formalism and implementation of PATR-II. In Barbara J. Grosz and Mark E. Stickel, editors, Research on Interactive Acquisition and Use of Knowledge, pages 39--79. AI Center, SRI International, Menlo Park, Cal., 1983.

Tre93

Ralf Treinen. Feature constraints with first-class features. In Andrzej M. Borzyszkowski and Stefan Sokoowski, editors, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 711, pages 734--743, Gdansk, Poland, 30 August--3 September 1993. Springer-Verlag.

VSJ88

K. Vijay-Shanker and A. K. Joshi. Feature structure based tree adjoining grammars. In Proc. of the 12 International Conference on Computational Linguistics, pages 714--719, Budapest, Hungary, 1988.

Zaj92

Rémi Zajac. Inheritance and constraint-based grammar formalisms. Computational Linguistics, 18(2):159--182, 1992.