Set operations for recurrent term schematizations

  • Ali Amaniss
  • Miki Hermann
  • Denis Lugiez
II CAAP CAAP-5: Set Constraints
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1214)


Reasoning on programs and automated deduction often require the manipulation of infinite sets of objects. Many formalisms have been proposed to handle such sets. Here we deal with the formalism of recurrent terms proposed by Chen and Hsiang and subsequently refined by several authors. These terms contains iterated parts and counter variables to control the iteration, providing an important gain in expressive power. However, little work has been devoted to the study of these terms as a mechanism to represent sets of terms equipped with the corresponding operations union, intersection, inclusion, membership. In this paper, we focus on the set operations relevant for this schematization formalism and we discuss several possible definitions of these operations. We show how intersection, membership and inclusion can be solved by previously known algorithms and we prove the decidability of the generalisation of two iterated terms, which is the analogy of set union. Moreover, we refine this procedure for computing the generalisation of usual first-order terms using iterated terms, therefore improving Plotkin's algorithm.


Logic Programming Integer Variable Generalisation Algorithm Automate Deduction Inductive Generalisation 


  1. [AKW95]
    A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Inf. and Comp., 122(1):30–44, 1995.CrossRefGoogle Scholar
  2. [Ama96]
    A. Amaniss. Méthodes de schématisation pour la démonstration automatique. PhD thesis, Université Henri Poincaré-Nancy 1, 1996.Google Scholar
  3. [BGW93]
    L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints axe the monadic class. In Proceedings 8th LICS, Montreal (Quebec, Canada), 1993.Google Scholar
  4. [CH95]
    H. Chen and J. Hsiang. Recurrence domains: their unification and application to logic programming. Inf. and Comp., 122:45–69, 1995.CrossRefGoogle Scholar
  5. [Com95]
    H. Comon. On unification of terms with integer exponent. Mathematical System Theory, 28(1):67–88, 1995.CrossRefGoogle Scholar
  6. [CP96]
    R. Caferra and N. Peltier. A significant extension of logic programming by adapting model building rules. In Proceedings ELP'96, volume 1050 of LNAI, pages 51–65, 1996.Google Scholar
  7. [HG97]
    M. Hermann and R. Galbavý. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, April 1997. to appear.Google Scholar
  8. [HS96]
    M. Hermann and G. Salzer. Solution of equational problems in the first-order theory of recurrent schematizations. Unpublished manuscript, October 1996.Google Scholar
  9. [Pel96]
    N. Peltier. Increasing model building capabilities by constraints solving on terms with integer exponents. submitted to J. Symb. Comp., 1996.Google Scholar
  10. [Sal92]
    G. Salzer. The unification of infinite sets of terms and its applications. In A. Voronkov, editor, Proceedings of the 1st LPAR, St. Petersburg (Russia), volume 624 of LNAI, pages 409–420. Springer-Verlag, July 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Ali Amaniss
    • 1
  • Miki Hermann
    • 1
  • Denis Lugiez
    • 1
  1. 1.CRIN-INRIAVandoeuvre les Nancy CedexFrance

Personalised recommendations