Skip to main content
SpringerLink
Log in

Sorted unification using set constraints

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

Included in the following conference series:

Abstract

This paper describes a new representation for sortal constraints and a unification algorithm for the corresponding constrained terms. Variables range over sets of terms described by systems of set constraints that can express limited inter-variable dependencies. These sets of terms are more general than regular tree languages, but are still closed under intersection. The new unification algorithm shows sorted unification to be decidable for a broad class of sorted signatures, which we call semilinear, and, more generally, for sort theories with a least Herbrand model that can be represented using the new constraints. A finite representation of a complete set of wellsorted unifiers can always be found, even in those cases where this set is infinite.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aiken and E. L. Wimmers. Solving systems of set constraints. Research report 8257 (#75451), IBM Almaden Research Center, 1991.

    Google Scholar 

  2. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proc. Symposium on Theoretical Aspects of Computer Science, pages 161–171. Springer-Verlag, 1992.

    Google Scholar 

  3. H-J. Burckert. A resolution principle for clauses with constraints. In Proc. 10th International Conference on Automated Deduction, pages 178–192. Springer-Verlag, July 1990.

    Google Scholar 

  4. H. Chen and J. Hsiang. Recurrence domains: Their unification and application to logic programming. Technical report, State University of New York at Stony Brook, July 1991. Short version appears as Logic Programming with Recurrence Domains, Proc. ICALP 91.

    Google Scholar 

  5. A. G. Cohn and A. M. Frisch. An abstract view of sorted unification. In Proc. 11th International Conference on Automated Deduction. Springer-Verlag, 1992. To appear.

    Google Scholar 

  6. A. G. Cohn. Taxonomic reasoning with many-sorted logics. Artificial Intelligence Review, 3:89–128, 1989.

    Google Scholar 

  7. H. Comon and C. Delor. Equational formulae with membership constraints. Rapport de Recherche 649, LRI, Université de Paris Sud, Orsay, France, March 1991. Revised version of Equational Formulas in Order-sorted Algebras, Proc. ICALP 90.

    Google Scholar 

  8. H. Comon. Inductive proofs by specifications transformation. In Proc. Rewriting Techniques and Applications, pages 76–91. Springer-Verlag, April 1989.

    Google Scholar 

  9. A. M. Frisch. The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence, 49:161–198, 1991.

    Google Scholar 

  10. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. Research report 16089 (#71415), IBM T.J. Watson Research Center, September 1990. Preliminary version appears in Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.

    Google Scholar 

  11. N. Heintze and J. Jaffar. A decision procedure for a class of herbrand set constraints. Technical Report CMU-CS-91-110, Carnegie Mellon University, February 1991. Abstract appears in Proc. of the 5th Annual IEEE Symposium on Logic in Computer Science, 1990.

    Google Scholar 

  12. J. Jaffar and J. Lassez. Constraint logic programming. In Proc. of the 14th ACM Principles of Programming Languages Conference, pages 111–119, Munich, January 1987.

    Google Scholar 

  13. M. Schmidt-Schauß. Computational Aspects of an Order-Sorted Logic with Term Declarations. Springer-Verlag, New York, 1989.

    Google Scholar 

  14. T. E. Uribe. Sorted unification and the solution of semi-linear membership constraints. Technical Report UIUCDCS-R-91-1720, University of Illinois, Urbana, Illinois, December 1991.

    Google Scholar 

Download references

Author information

Author notes

  1. Tomás E. Uribe

    Present address: , Apartado Aéreo, 100677, Bogotá, Colombia

Authors and Affiliations

  1. Dept. of Computer Science and Beckman Institute, University of Illinois, 405 North Mathews Avenue, 61801, Urbana, Illinois, USA

    Tomás E. Uribe

Authors
  1. Tomás E. Uribe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uribe, T.E. (1992). Sorted unification using set constraints. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_163

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation