From context-free to definite-clause grammars: A type-theoretic approach

Journal of Logic Programming

Volumn 30, Issue 1, 1997, Pages 1-23

  Haas, Juergen ^b   Jayaraman, Bharat ^a  

^a the State University of New York   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONTEXT FREE GRAMMARS; DATA STRUCTURES; NATURAL LANGUAGE PROCESSING SYSTEMS; QUERY LANGUAGES;

COMPOSITIONALITY; DEFINITE CLAUSE GRAMMAR; SEMANTIC REPRESENTATION LANGUAGE; SEMANTICS;

LOGIC PROGRAMMING;

EID: 0030783516     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00015-5     Document Type: Article

References (22)

1. Abramson, H. and Dahl, V., Logic Grammars, Springer-Verlag, New York, 1989.
2. Church, A., A formulation of the simple theory of types, J. Symb. Logic 5(1):56-68 (1940).
3. Colmerauer, A., Metamorphosis Grammars, vol. 63 of Lecture Notes in Computer Science, Springer-Verlag, New York, 1978.
4. Dowek, G., Third Order Matching Is Decidable, in: 7th Annual LICS, 1992, pp. 2-10.
5. Dowty, D. R., Wall, R. E., and Peters, S., Introduction to Montague Semantics, Reidel, Boston, MA, 1981.
6. Dymetman, M. and Isabelle, P., Grammar Bidirectionality through Controlled Backward Deduction, in: P. Saint-Dizier and S. Szpakowicz (eds.), Logic and Logic Grammars for Language Processing, Ellis Horwood, 1990, pp. 275-293.
7. Haas, J., Inference of Semantics from Examples: From Context-Free to Definite-Clause Grammars, Department of Computer Science, SUNY-Buffalo, 1993. Available from UMI Dissertations, Ann Arbor, MI.
8. Haas, J. and Jayaraman, B., Interactive Synthesis of Definite-Clause Grammars, in: K. Apt (ed.), Proc. Joint Int. Conf. and Symp. on Logic Programming, MIT Press, 1992, pp. 541-555.
9. Hagiya, M., Programming by Example and Proving by Example Using Higher-Order Unification, in: M. E. Stickel (ed.), Proc. 10th Conf. on Automated Deduction, Springer-Verlag, LNAI 449, 1990, pp. 588-602.
10. Hagiya, M., From Programming by Example to Proving by Example, in: T. Ito and A. R. Meyer (eds.), Proc. Int. Conf. on Theoretical Aspects of Computer Software, Springer-Verlag LNCS 526, 1991, pp. 387-419.
11. Huet, G. P., A Unification Algorithm for Typed λ-Calculus, Theoretical Comput. Sci. 1:27-57 (1975).
12. Huet, G. P. and Lang, B., Proving and Applying Program Transformations Expressed with Second-Order Patterns, Acta Informatica 11:31-55 (1978).
13. Miller, D. and Nadathur, G., Some Uses of Higher-Order Logic in Computational Linguistics, in: Proc. 24th Annu. Assoc. for Comp. Ling., 1992, pp. 247-255.
14. Miller, D., A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification, in: P. Schroeder-Heister (ed.), Proc. Extensions of Logic Programming, Springer-Verlag LNAI 475, 1991, pp. 253-282.
15. Nadathur, G. and Miller, D., An Overview of λProlog, in: Proc. 5th ICLP, 1988, pp. 810-827.
16. Nadathur, G. and Miller, D., Higher-Order Horn Clauses, J. ACM 777-814 (1990).
17. Pereira, F. C. N. and Shieber, S. M., Prolog and Natural-Language Analysis, Center for the Study of Language and Information, Stanford, CA, 1987.
18. Pereira, F. C. N. and Warren, D. H. D., Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Transition Networks, Artificial Intelligence 13:231-278 (1980).
19. Shieber, S. M., van Noord, G., Pereira, F. C. N., and Moore, R. C., Semantic-Head-Driven Generation, Computational Linguistics 16(1):30-42 (1990).
20. van Benthem, J. F. A. K., Essays in Logical Semantics, Reidel, Hingham, MA, 1986, Chap. 10.
21. Velardi, P., Natural Language Interfaces to Databases: Features and Limitations, in: Entity-Relationship Approach: A Bridge to the User, Proc. 7th Int. Conf., North-Holland, 1989, pp. 35-40.
22. Zadrozny, W., On Compositional Semantics, in: Proc. COLING 1992, Nantes, France, 1992, pp. 260-266.