Solving Equations Involving Sequence Variables and Sequence Functions

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

Volumn 3249, Issue , 2004, Pages 157-170

  Kutsia, Temur ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FUNCTION SYMBOLS; MINIMALITY; SEQUENCE VARIABLES;

ARTIFICIAL INTELLIGENCE;

EID: 33745457014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_14     Document Type: Article

References (18)

1. H. Abdulrab and J.-P. Pécuchet. Solving word equations. J. Symbolic Computation, 8(5):499-522, 1990.
2. F. Baader and K. U. Schulz. Unification hi the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation, 21(2):211-244, 1996.
3. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 8, pages 445-532. Elsevier Science, 2001.
4. W. W. Bledsoe and Guohui Feng. SET-VAR. J. Automated Reasoning, 11(3):293314, 1993.
5. H. Boley. A Tight, Practical Integration of Relations and Functions, volume 1712 of LNAI. Springer, 1999.
6. B. Buchberger, G. Dupré, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W. Windsteiger. The THEOREMA project: A progress report. In M. Kerber and M. Kohlhase, editors, Proc. of Calculemus'2000 Conference, pages 98-113, St. Andrews, UK, 6-7 August 2000.
7. M. L. Ginsberg. User's guide to the MVL system. Technical report, Stanford University, Stanford, California, US, 1989.
8. J. Jaffar. Minimal and complete word unification. J. ACM, 37(l):47-85, 1990.
9. M. Kohlhase. A mechanization of sorted higher-order logic based on the resolution principle. PhD Thesis. Universität des Saarlandes. Saarbrücken, Germany, 1994.
10. T. Kutsia. Solving and proving in equational theories with sequence variables and flexible arity symbols. Technical Report 02-31, RISC-Linz, Austria, 2002.
11. T. Kutsia. Equational prover of THEOREMA. In R. Nieuwenhuis, editor, Proc. of the 14th Int. Conference on Rewriting Techniques and Applications (RTA '03), volume 2706 of LNCS, pages 367-379, Valencia, Spain, 9-11 June 2003. Springer.
12. T. Kutsia. Solving equations involving sequence variables and sequence functions. Technical Report 04-01, RISC, Johannes Kepler University, Linz, Austria, 2004. http://www.risc.uni-linz.ac.at/people/tkutsia/papers/SeqUnif.ps.
13. M. Marin and T. Kutsia. On the implementation of a rule-based programming system and some of its applications. In B. Konev and R. Schmidt, editors, Proc. of the 4th Int. Workshop on the Implementation of Logics (WIL'03), pages 55-68, Almaty, Kazakhstan, 2003.
14. L. Paulson. ISABELLE: the next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
15. G. Plotkin. Building in equational theories. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 7, pages 73-90. Edinburgh University Press, 1972.
16. J. Richardson and N. E. Fuchs. Development of correct transformation schemata for Prolog programs. In N. E. Fuchs, editor, Proc. of the 7th Int. Workshop on Logic Program Synthesis and Transformation (LOPSTR'97), volume 1463 of LNCS, pages 263-281, Leuven, Belgium, 10-12 July 1997. Springer.
17. R. Schmidt. -Unification for subsystems of S4. In T. Nipkow, editor, Proc. of the 9th Int. Conference on Rewriting Techniques and Applications, RTA '98, volume 1379 of LNCS, pages 106-120, Tsukuba, Japan, 1998. Springer.
18. S. Wolfram. The Mathematica Book. Cambridge University Press and Wolfram Research, Inc., fourth edition, 1999.