Tractable and intractable second-order matching problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 432-441

  Hirata, Kouichi ^a   Yamada, Keizo ^a   Harao, Masateru ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; POLYNOMIAL APPROXIMATION;

BINARY FUNCTIONS; FIRST ORDER; NP COMPLETE; POLYNOMIAL-TIME; SECOND ORDERS; SECOND-ORDER MATCHING; TERNARY FUNCTIONS; UNARY FUNCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 36849075107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_43     Document Type: Conference Paper

References (19)

1. Amiot, G.: The undecidability of the second order predicate unification problem, Archive for Mathematical Logic 30, 193-199, 1990
2. Baxter, L. D.: The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo, 1977
3. Curien, R., Qian, Z. and Shi, H.: Efficient second-order matching, Proc. 7th International Conference on Rewriting Techniques and Applications, LNCS 1103, 317-331, 1996
4. Défourneaux, G., Bourely, C. and Peltier, N.: Semantic generalizations for proving and disproving conjectures by analogy, Journal of Automated Reasoning 20, 27-45, 1998
5. Donat, M. R. and Wallen, L. A.: Learning and applying generalized solutions using higher order resolution, Proc. 9th International Conference on Automated Deduction, LNCS 310, 41-60, 1988
6. Dowek, G.: A unification algorithm for second-order linear terms, manuscript, 1993, also available at http://coq.inria.fr/~dowek/.
7. Farmer, W. M.: A unification algorithm for second-order monadic terms, Annals of Pure and Applied Logic 39, 131-174, 1988
8. Farmer, W. M.: Simple second-order languages for which unification is undecidable, Theoretical Computer Science 87, 25-41, 1991
9. Flener, P.: Logic program synthesis from incomplete information, Kluwer Academic Press, 1995
10. Garey, M. R. and Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, 1979
11. Ganzinger, H., Jacquemard, F. and Veanes, M.: Rigid reachability, Proc. 4th Asian Computing Science Conference, LNCS 1538, 1998, also available at http://www.mpi-sb.mpg.de/~hg/.
12. Goldfarb, W. D.: The undecidability of the second-order unification problem, Theoretical Computer Science 13, 225-230, 1981
13. Harao, M.: Proof discovery in LK system by analogy, Proc. 3rd Asian Computing Science Conference, LNCS 1345, 197-211, 1997
14. Huet, G. P. and Lang, B.: Proving and applying program transformations expressed with second-order patterns, Acta Informatica 11, 31-55, 1978
15. Levy, J.: Linear second-order unification, Proc. 7th International Conference on Rewriting Techniques and Applications, LNCS 1103, 332-346, 1996
16. Levy, J.: Decidable and undecidable second-order unification problem, Proc. 9th International Conference on Rewriting Techniques and Applications, LNCS 1379, 47-60, 1998
17. Levy, L. and Veanes, M.: On unification problems in restricted second-order languages, Proc. Annual Conference of the European Association for Computer Science Logic (CSL'98), 1998, also available at http://www.iiia.csic.es/~levy/.
18. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification, Journal of Logic and Computation 1, 497-536, 1991
19. Prehofer, C.: Decidable higher-order unification problems, Proc. 12th International Conference on Automated Deduction (CADE 12), LNAI 814, 635-649, 1994.