Skip to main content
SpringerLink
Log in
Book cover

French School on Theoretical Computer Science

TCS School 1994: Constraint Programming: Basics and Trends pp 62–67Cite as

Constraints in term algebras an overview of constraint solving techniques

  • Conference paper
  • First Online:

  • 169 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 910))

Abstract

We will give a very brief overview on three methods for solving constraints over term algebras, namely formula rewriting, automata techniques and combination techniques. For results which illustrate the specific methods, we give literature pointers (which may be indirect ones, i.e., to more extensive surveys).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Backofen and G. Smolka. A complete and recursive feature theory. Research Report RR-92-30, DFKI, Saarbrücken, Sept. 1992. To appear in Theoretical Computer Science.

    Google Scholar 

  2. R. Backofen and R. Treinen. How to win a game with features. In J.-P. Jouannaud, editor, Proc. Int. Conf. on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 320–335. Springer-Verlag, Sept. 1994.

    Google Scholar 

  3. A. Boudet. Combining unification algorithms. Journal of Symbolic Computation, 16:597–626, 1993.

    Google Scholar 

  4. A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proc. 5th. Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, Montreal, Canada, 1993. Springer-Verlag.

    Google Scholar 

  5. H. Comon. Disunification: a survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991.

    Google Scholar 

  6. H. Comon. Constraints in term algebras (short survey). In T. R. M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Univ. of Twente, 1993. Springer Verlag, series Workshop in Computing. Invited talk.

    Google Scholar 

  7. H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167–216, Aug. 1994.

    Google Scholar 

  8. H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, cycle-syntacticness and shallow theories. Information and Computation, 111(1), May 1994.

    Google Scholar 

  9. H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371–425, 1989.

    Google Scholar 

  10. H. Comon and R. Treinen. Ordering constraints on trees. In S. Tison, editor, Proc. CAAP 94, LNCS, Edinburgh, Apr. 1994. Springer Verlag. (Invited Lecture).

    Google Scholar 

  11. M. Dauchet. Rewriting and tree automata. In H. Comon and J.-P. Jouannaud, editors, Proc. Spring School on Theoretical Computer Science: Rewriting, Lecture Notes in Computer Science, to appear, Odeillo, France, 1994. Springer-Verlag.

    Google Scholar 

  12. T. Frühwirth. Constraint simplification rules. Technical report, ECRC Munchen, 1992.

    Google Scholar 

  13. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proc. 10th Symposium on Theoretical Aspects of Computer Science, Würzburg, LNCS, 1993.

    Google Scholar 

  14. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proc. 34th Symposium on Foundations of Computer Science, pages 372–380, Palo Alto, CA, Nov. 1993. IEEE Computer society press.

    Google Scholar 

  15. J.-P. Jouannaud, editor. Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  16. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.

    Google Scholar 

  17. D. Kapur and P. Narendran. Double-exponential complexity of computing a complete set of ac-unifiers. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz, June 1992.

    Google Scholar 

  18. M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, pages 348–357, July 1988.

    Google Scholar 

  19. A. Mal'cev. On the elementary theories of locally free algebras. Soviet Math. Doklady, 1961.

    Google Scholar 

  20. M. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595–629. North-Holland, 1977.

    Google Scholar 

  21. C. Ringeissen. Combinaison de résolutions de contraintes. Thèse de Doctorat, Université de Nancy I, France, Dec. 1993.

    Google Scholar 

  22. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation, 1990. Special issue on Unification.

    Google Scholar 

  23. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134–191. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS and LRI Université de Paris Sud, Bat. 490, 91405, Orsay cedex, France

    Hubert Comon

Authors
  1. Hubert Comon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Podelski

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Comon, H. (1995). Constraints in term algebras an overview of constraint solving techniques. In: Podelski, A. (eds) Constraint Programming: Basics and Trends. TCS School 1994. Lecture Notes in Computer Science, vol 910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59155-9_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-59155-9_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59155-9

  • Online ISBN: 978-3-540-49200-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation