Skip to main content
SpringerLink
Log in

Unification Modulo ACUI Plus Distributivity Axioms

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

E-unification problems are central in automated deduction. In this work, we consider unification modulo theories that extend the well-known ACI or ACUI by adding a binary symbol “*” that distributes over the AC(U)I-symbol “+.” If this distributivity is one-sided (say, to the left), we get the theory denoted AC(U)ID l ; we show that AC(U)ID l -unification is DEXPTIME-complete. If “*” is assumed two-sided distributive over “+,” we get the theory denoted AC(U)ID; we show unification modulo AC(U)ID to be NEXPTIME-decidable and DEXPTIME-hard. Both AC(U)ID l and AC(U)ID seem to be of practical interest, for example, in the analysis of programs modeled in terms of process algebras. Our results, for the two theories considered, are obtained through two entirely different lines of reasoning. A consequence of our methods of proof is that, modulo the theory that adds to AC(U)ID the assumption that “*” is associative-commutative, or just associative, unification is undecidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Google Scholar 

  6. Baader, F. and Narendran, P.: Unification of concept terms in description logics, J. Symbolic Comput. 31(3) (2001), 277–305.

    Google Scholar 

  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. 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/

  11. Focardi, R.: Analysis and automatic detection of information flows and network systems, Doctoral Thesis, Technical Report UBLCS-99-16, University of Bologna, July 1999.

  12. 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.

  13. 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).

    Google Scholar 

  14. Minsky, M.: Computation: Finite and Infinite Machines, Prentice-Hall, London, 1972.

    Google Scholar 

  15. Narendran, P.: On solving linear equations over polynomial semirings, in Proc. 11th Annual Symp. on Logic in Computer Science, July 1996, pp. 466–472.

  16. Narendran, P. and Rusinowitch, M.: Any ground associative-commutative theory has a finite canonical system, J. Automated Reasoning 17 (1996), 131–143.

    Google Scholar 

  17. Nutt, W.: Unification in monoidal theories, in M. Stickel (ed.), Proc. CADE-10, LNAI 449, Springer-Verlag, pp. 618–632.

  18. 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.

    Google Scholar 

  19. Schmidt-Schauss, M.: A decision algorithm for distributive unification, Theoret. Comput. Sci. 208(1–2) (1998), 111–148.

    Google Scholar 

  20. Seidl, H.: Haskell overloading is DEXPTIME-complete, Inform. Process. Lett. 52(2) (1994), 57–60.

    Google Scholar 

  21. Siekmann, J. and Szabo, P.: The undecidability of D A -unification problem, J. Symbolic Logic 54(2) (1989), 402–414.

    Google Scholar 

  22. Talbot, J.-M., Devienne, Ph. and Tison, S.: Generalized Definite Set Constraints, In CONSTRAINTS: An International Journal 5(1–2): 161–202, 2000.

    Google Scholar 

  23. Tiden, E. and Arnborg, S.: Unification Problems with One-sided Distributivity, Journal of Symbolic Computation 3(1–2): 183–202, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Orléans, France

    Siva Anantharaman

  2. University at Albany, SUNY, USA

    Paliath Narendran

  3. LORIA, Nancy, France

    Michael Rusinowitch

Authors
  1. Siva Anantharaman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paliath Narendran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Rusinowitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siva Anantharaman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anantharaman, S., Narendran, P. & Rusinowitch, M. Unification Modulo ACUI Plus Distributivity Axioms. J Autom Reasoning 33, 1–28 (2004). https://doi.org/10.1007/s10817-004-2279-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-004-2279-7

Keywords

Search

Navigation