Unification modulo ACUI plus distributivity axioms

Journal of Automated Reasoning

Volumn 33, Issue 1, 2004, Pages 1-28

  Anantharaman, Siva ^a   Narendran, Paliath ^b   Rusinowitch, Michael ^c  

^a LIFO   (France)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c LORIA   (France)

Author keywords

Complexity; Counter machines; Decidability; Equational unification; Post correspondence problem; Rewriting; Set constraints

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

COUNTER MACHINES; EQUATIONAL UNIFICATION; POST CORRESPONDENCE PROBLEMS; REWRITING; SET CONSTRAINTS;

AUTOMATA THEORY;

EID: 14844349828     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10817-004-2279-7     Document Type: Article

References (25)

1. Aiken, A. and Wimmers, E.: Solving systems of set constraints, in Proc. 7th IEEE Symposium on Logic in Computer Science (LICS'92), 1992, pp. 329-340.
2. Aiken, A., Kozen, D., Vardi, M. and Wimmers, E.: The complexity of set constraints, in Proc. Conf. CSL'93, EACSL, September 1993, pp. 1-18.
3. Anantharaman, S., Narendran, P. and Rusinowitch, M.: Unification over ACUI plus distributivity/homomorphisms, in Proc. CADE-19, LNAI 2741, Springer-Verlag, pp. 442-458.
4. Anantharaman, S., Narendran, P. and Rusinowitch, M.: ACID-unification is NEXPTIME-decidable, in Proc. MFCS'03, LNCS 2747, Springer-Verlag, pp. 169-179.
5. Baader, F.: Unification in commutative theories, J. Symbolic Comput. 8 (1989), 479-497.
6. Baader, F. and Narendran, P.: Unification of concept terms in description logics, J. Symbolic Comput. 31(3) (2001), 277-305.
7. Baader, F. and Schulz, K. U.: Unification in the union of disjoint equational theories: Combining decision procedures, in Proc. 11th Conference on Automated Deduction (CADE-11), Saratoga Springs (NY), LNAI 607, Springer-Verlag, 1992, pp. 50-65.
8. Bachmair, L., Ganzinger, H. and Waldmann, U.: Set constraints are the monadic class, in Proc. 8th IEEE Symposium on Logic in Computer Science (LICS'93), 1993, pp. 75-83.
9. Charatonik, W. and Podelski, A.: Set constraints with intersection, in Proc. 12th IEEE Symposium on Logic in Computer Science (LICS'97), Warsaw, 1997, pp. 362-372. (To appear in Information and Computation.)
10. Charatonik, W. and Podelski, A.: Set constraints with intersection, in Proc. 12th IEEE Symposium on Logic in Computer Science (LICS'97), Warsaw, 1997, pp. 362-372. (To appear in Information and Computation.)
11. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M.: Tree automata techniques and applications, http://www.grappa.univ-lille3.fr/tata/
12. Focardi, R.: Analysis and automatic detection of information flows and network systems, Doctoral Thesis, Technical Report UBLCS-99-16, University of Bologna, July 1999.
13. Gilleron, R., Tison, S. and Tommasi, M.: Solving systems of set constraints using tree automata, in Proc. STACS'93, LNCS 665, Springer-Verlag, pp. 505-514.
14. Gilleron, R., Tison, S. and Tommasi, M.: Set constraints and tree automata, Inform. and Comput. 149 (1999), 1-41 (see also Tech. Report IT 292, Laboratoire-LIFL, Lille, 1996).
15. Gilleron, R., Tison, S. and Tommasi, M.: Set constraints and tree automata, Inform. and Comput. 149 (1999), 1-41 (see also Tech. Report IT 292, Laboratoire-LIFL, Lille, 1996).
16. Minsky, M.: Computation: Finite and Infinite Machines, Prentice-Hall, London, 1972.
17. Narendran, P.: On solving linear equations over polynomial semirings, in Proc. 11th Annual Symp. on Logic in Computer Science, July 1996, pp. 466-472.
18. Narendran, P. and Rusinowitch, M.: Any ground associative-commutative theory has a finite canonical system, J. Automated Reasoning 17 (1996), 131-143.
19. Nutt, W.: Unification in monoidal theories, in M. Stickel (ed.), Proc. CADE-10, LNAI 449, Springer-Verlag, pp. 618-632.
20. Schmidt-Schauss, M.: Decidability of unification in the theory of one-sided distributivity and a multiplicative unit, J. Symbolic Comput. 22(3) (1997), 315-344.
21. Schmidt-Schauss, M.: A decision algorithm for distributive unification, Theoret. Comput. Sci. 208(1-2) (1998), 111-148.
22. Seidl, H.: Haskell overloading is DEXPTIME-complete, Inform. Process. Lett. 52(2) (1994), 57-60.
23. A- unification problem, J. Symbolic Logic 54(2) (1989), 402-414.
24. Talbot, J.-M., Devienne, Ph. and Tison, S.: Generalized Definite Set Constraints, In CONSTRAINTS: An International Journal 5(1-2): 161-202, 2000.
25. Tiden, E. and Arnborg, S.: Unification Problems with One-sided Distributivity, Journal of Symbolic Computation 3(1-2): 183-202, 1987.