Abstract
We consider the unification problem for the equational theory AC(U)ID obtained by adjoining a binary ‘*’ which is distributive over an associative-commutative idempotent operator ‘+’, possibly admitting a unit element U. We formulate the problem as a particular class of set constraints, and propose a method for solving it by using the dag automata introduced by W. Charatonik, that we enrich with labels for our purposes. AC(U)ID-unification is thus shown to be in NEXPTIME.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiken, A., Wimmers, E.: Solving Systems of Set Constraints. In: Proc. of the 7th IEEE Symposium on Logic in Computer Science (LICS 1992), pp. 329–340 (1992)
Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The Complexity of Set Constraints. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 1–18. Springer, Heidelberg (1994)
Anantharaman, S., Narendran, P., Rusinowitch, M.: Unification over ACUI plus Distributivity/Homomorphisms. To appear in Proc. of CADE-19 (2003), cf. also the long version: ftp://ftp-lifo.univ-orleans.fr/pub/Users/siva/RR2002-11.ps
Anantharaman, S., Narendran, P., Rusinowitch, M.: AC(U)ID-Unification is NEXPTIME-Decidable. Research Report RR-2003-02, LIFO, Université d’Orleans (Fr.), ftp://ftp-lifo.univ-orleans.fr/pub/Users/siva/RR2003-02.ps
Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning. Elsevier Science Publishers, Amsterdam (2001)
Bachmair, L., Ganzinger, H., Waldmann, U.: Set Constraints are the Monadic Class. In: Proceedings of the 8th IEEE Symp. on Logic in Computer Science (LICS 1993), pp. 75–83 (1993)
Charatonik, W.: Automata on DAG representations of finite trees. Technical Report MPI-I-99-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 642–653 (1994)
Charatonik, W., Podelski, A.: Set Constraints with Intersection. In: Proc. of the 12th IEEE Symposium on Logic in Computer Science (LICS 1997), Warsaw, pp. 362–372 (1997); To appear in: Information and Computation
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, http://www.grappa.univ-lille3.fr/tata/
Gilleron, R., Tison, S., Tommasi, M.: Solving Systems of Set Constraints using Tree Automata. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol. 665, pp. 505–514. Springer, Heidelberg (1993)
Gilleron, R., Tison, S., Tommasi, M.: Set Constraints and Tree Automata. Information and Computation 149, 1–41 (1999)
Talbot, J.-M., Devienne, P., Tison, S.: Generalized Definite Set Constraints. CONSTRAINTS: an International Journal 5(1-2), 161–202 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anantharaman, S., Narendran, P., Rusinowitch, M. (2003). ACID-Unification Is NEXPTIME-Decidable. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive