Managing structural information by higher-order colored unification

Journal of Automated Reasoning

Volumn 25, Issue 2, 2000, Pages 123-164

  Hutter, Dieter ^a   Kohlhase, Michael ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; PATTERN MATCHING;

HIGHER-ORDER COLORED UNIFICATION; INDUCTIVE THEOREM PROVING;

THEOREM PROVING;

EID: 0033715708     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006282725324     Document Type: Article

References (35)

1. Barendregt, H. P.: The Lambda-Calculus: Its Syntax and Semantics, North-Holland, 1980.
2. Basin, D. and Walsh, T.: A calculus for and termination of rippling, Special Issue of the J. Automated Reasoning 16(1-2) (1996), 147-180.
3. Breazu-Tannen, V.: Polymorphic rewriting conserves algebraic strong normalization and confluence, in Proceedings of the ICALP, 1989, pp. 137-150.
4. Bundy, A., Stevens, A., van Harmelen, R, Ireland, A. and Small, A.: Rippling: A heuristic for guiding inductive proofs, Artif. Intel. 62 (1993), 185-253.
5. Bundy, A.: The use of explicit plans to guide inductive proofs, in E. L. Lusk and R. A. Overbeek (eds), Proceedings of the 9th Conference on Automated Deduction, LNCS 310, Argonne, Illinois, USA, 1988, pp. 111-120.
6. Church, A.: A formulation of the simple theory of types, J. Symbolic Logic 5 (1940), 56-68.
7. Dalrymple, M., Shieber, S. and Pereira, F.: Ellipsis and higher-order unification, Linguistics and Philosophy 14 (1991), 399-452.
8. Debusmann, R., Egg, M., Gardent, C., Koller, A., Konrad, K., Niehren, J., Schaefer, G., Thater, S., Winter, V. and Xu, F.: A natural language system for semantic construction and evaluation, CLAUS Report 102, University of theSaarland, Saarbrücken, 1998.
9. Dowek, G.: Third order matching is decidable, Ann. Pure Appl. Math. 69 (1994), 135-155.
10. Gabbay, D.: Labelled Deductive Systems, Oxford Logic Guides 33, Oxford University Press, 1996.
11. Gardent, C. and Kohlhase, M.: Higher-order coloured unification and natural language semantics, in A. Zampolli (ed.), Proceedi ngs of COLING '96, 1996.
12. Gardent, C. and Kohlhase, M.: Computing parallelism in discourse, in Proceedings 15th International Joint Conferenceon Artifidal Intelligence(IJCAI), Nagoya, Japan, Morgan Kaufman Publ., 1997.
13. Gardent, C.: Sloppy identity, in C. Retoré (ed.), Logical Aspects of Computational Linguisties, Springer, 1997, pp. 188-207.
14. Gardent, C., Kohlhase, M. and Konrad, K.: Higher-order coloured unification: A linguistic application, CLAUS Report 97, University of the Saarland, Saarbrücken, 1997.
15. Gardent, C., Kohlhase, M. and Konrad, K.: Higher-order coloured unification: A linguistic application, Techniques Sciences Informatiques, 1999, pp. 1-28.
16. Goldfarb, W. D.: The undecidability of the second-order unification problem, Theoret. Comput. Sci. 13 (1981), 225-230.
17. Hesketh, J.: Using Middle-Out Reasoning to Guide Induction, PhD thesis, University of Edinburgh, Edinburgh, Scotland, 1981.
18. Hindley, J. and Seldin, J.: Introduction to Combinators and Lambda Calculus, Cambridge University Press, 1986.
19. Hutter, D.: Guiding induction proofs, in M. Stickel (ed.), Proceedings of the 10th Conference on Automated Deduction, LNCS449, Kaiserslautern, Germany, 1990, pp. 147-161.
20. Hutter, D.: Using rippling for equational reasoning, in S. Hölldobler (ed.), Proceedings 20th German Annual Conference on Artifidal Intelligence Kl-96, Dresden, Germany, LNAI 1137, Springer-Verlag, 1996, pp. 121-134.
21. Hutter, D.: Colouring terms to control equational reasoning, J. Automated Reasoning 18 (1997), 399-442.
22. Hutter, D.: Hierarchical proof planning using abstractions, in D. Dankel II (ed.), Proceedings 10th Annual Florida Al Research Symposium, FLAlRS 97, Track Using Al Methods to Control Automated Deduction, Daytona Beach, USA, 1997, pp. 181-185.
23. Ireland, A. and Bundy, A.: Productive use of failure in inductive proof, Special Issue of the J. Automated Reasoning 16(1-2) (1996), 79-111.
24. Kohlhase, M.: A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle, PhD thesis, Universität des Saarlandes, 1994.
25. Kraan, I., Basin, D. and Bundy, A.: Middle-out reasoning for synthesis and induction, J. Automated Reasoning 16(1-2) (1996), 113-145.
26. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification, J. Logic Comput. 1(4) (1991), 497-536.
27. Miller, D.: Unification under a mixed prefix, J. Symbolic Comput. 14 (1992), 321-358.
28. Montague, R.: The proper treatment of quantification in ordinary English, in R. Montague (ed.), Formal Philosophy. Selected Papers, Yale University Press, New Haven, 1974.
29. Padovani, V.: Filtrage d'order supérieur, These de doctorat, Université Paris VII, 1996.
30. Prehofer, C.: Decidable higher-order unification problems, in A. Bundy (ed.), Proceedings of the 12th conference on Automated Deduction, LNAI 814, Nancy, France, Springer-Verlag, 1994, pp. 635-649.
31. Small, A., and Green, I., Higher-order annotated terms for proof search, in Proceedings of the International Conference on Theorem Proving in Higher Order Logics (TPHOLs'96), 1996.
32. Snyder, W.: A Proof Theory for General Unification, Progress in Computer Science and Applied Logic, Birkhäuser, 1991.
33. Statman, R.: Logical relations and the typed lambda calculus, Inform. and Comput. 65(1985).
34. Tait, W.: Intensional interpretation of functional of finite type I, Inform. and Comput. 32 (1967), 198-212.
35. Walsh, T., Nunes, A. and Bundy, A.: The use of proof plans to sum series, in D. Kapur (ed.), Proceedings of the 11th Conference on Automated Deduction, LNCS 607, Saratoga Spings, NY, USA, Springer-Verlag, 1992, pp. 325-339.