Unification with sequence variables and flexible arity symbols and its extension with pattern-terms

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

Volumn 2385, Issue , 2002, Pages 290-304

  Kutsia, Temur ^a,b  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^b SOFTWARE COMPETENCE CENTER HAGENBERG   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

FREE CONSTANTS; FUNCTION SYMBOLS; SEQUENCE VARIABLES;

COMPUTATION THEORY;

EID: 84957013698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45470-5     Document Type: Conference Paper

References (30)

1. H. Abdulrab and J.-P. Pécuchet. Solving word equations. J. Symbolic Computation, 8(5):499–522, 1990.
2. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, pages 445–532. Elsevier Science, 2001.
3. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. String operations in query languages. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001.
4. B. Buchberger. Mathematica as a rewrite language. In T. Ida, A. Ohori, and M. Takeichi, editors, Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming), pages 1–13, Shonan Village Center, Japan, 1–4 November 1996. World Scientific.
5. B. Buchberger. Personal communication, 2001.
6. B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W. Windsteiger. The Theorema project: A progress report. In M. Kerber and M. Kohlhase, editors, Symbolic Computation and Automated Reasoning (Proceedings of CALCULEMUS 2000), pages 98–113, St. Andrews, 6–7 August 2000.
7. A. Colmerauer. An introduction to Prolog III. CACM, 33(7):69–91, 1990.
8. A. Farquhar, R. Fikes, and J. Rice. The Ontolingua Server: A tool for collaborative ontology construction. Int. J. of Human-Computer Studies, 46(6):707–727, 1997.
9. M. R. Genesereth. Epilog for Lisp 2. 0 Manual. Epistemics Inc., Palo Alto, 1995.
10. M. R. Genesereth and R. E. Fikes. Knowledge Interchange Format, Version 3. 0 Reference Manual. Technical Report Logic-92-1, Computer Science Department, Stanford University, Stanford, June 1992.
11. S. Ginsburg and X. S. Wang. Pattern matching by Rs-operations: Toward a unified approach to querying sequenced data. In Proceedings of the 11th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, pages 293–300, San Diego, 2–4 June 1992.
12. G. Grahne, M. Nykänen, and E. Ukkonen. Reasoning about strings in databases. In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 303–312, Minneapolis, 24–26 May 1994.
13. G. Grahne and E. Waller. How to make SQL stand for string query language. Lecture Notes in Computer Science, 1949:61–79, 2000.
14. M. Hamana. Term rewriting with sequences. In Proceedings of the First International Theorema Workshop, Hagenberg, Austria, 9–10 June 1997.
15. J. Jaffar. Minimal and complete word unification. J. of ACM, 37(1):47–85, 1990.
16. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–298, Oxford, 1967. Pergamon Press. Appeared 1970.
17. T. Kutsia. Unification in a free theory with sequence variables and flexible arity symbols and its extensions. Technical report, RISC-Linz, 2002. Available from ftp://ftp. risc. uni-linz. ac. at/pub/people/tkutsia/reports/unification. ps. gz.
18. A. Lentin. Equations in free monoids. In M. Nivat, editor, Automata, Languages and Programming, pages 67–85, Paris, 3–7 July 1972. North-Holland.
19. G. S. Makanin. The problem of solvability of equations on a free semigroup. Math. USSR Sbornik, 32(2), 1977.
20. G. Mecca and A. J. Bonner. Sequences, Datalog and transducers. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 23–35, San Jose, 22–25 May 1995.
21. F. Mora. Gröbner bases for non-commutative polynomial rings. In J. Calmet, editor, Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes (AAECC-3), volume 229 of LNCS, pages 353–362, Grenoble, July 1985. Springer Verlag.
22. R. Nieuwenhuis and A. Rubio. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation, 19:321–351, 1995.
23. P. Hayes and C. Menzel. A semantics for the knowledge interchange format. Available from http://reliant. teknowledge. com/IJCAI01/HayesMenzel-SKIFIJCAI2001. pdf, 2001.
24. G. Plotkin. Building in equational theories. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 7, pages 73–90. Edinburgh University Press, 1972.
25. A. Rubio. Theorem proving modulo associativity. In Proceedings of the Conference of European Association for Computer Science Logic, LNCS, Paderborn, Germany, 1995. Springer Verlag.
26. K. U. Schulz. Word unification and transformation of generalized equations. J. Automated Reasoning, 11(2):149–184, 1993.
27. J. Siekmann. String unification. Research paper, Essex University, 1975.
28. J. Siekmann. Unification and matching problems. Memo, Essex University, 1978.
29. M. Widera and C. Beierle. A term rewriting scheme for function symbols with variablearity. TR 280, Prakt. Informatik VIII, FernUniversitaet Hagen, 2001.
30. S. Wolfram. The Mathematica Book. Cambridge University Press and Wolfram Research, Inc., fourth edition, 1999.