Abstract
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.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Inf. and Comp., 122(1):30–44, 1995.
A. Amaniss. Méthodes de schématisation pour la démonstration automatique. PhD thesis, Université Henri Poincaré-Nancy 1, 1996.
L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints axe the monadic class. In Proceedings 8th LICS, Montreal (Quebec, Canada), 1993.
H. Chen and J. Hsiang. Recurrence domains: their unification and application to logic programming. Inf. and Comp., 122:45–69, 1995.
H. Comon. On unification of terms with integer exponent. Mathematical System Theory, 28(1):67–88, 1995.
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.
M. Hermann and R. Galbavý. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, April 1997. to appear.
M. Hermann and G. Salzer. Solution of equational problems in the first-order theory of recurrent schematizations. Unpublished manuscript, October 1996.
N. Peltier. Increasing model building capabilities by constraints solving on terms with integer exponents. submitted to J. Symb. Comp., 1996.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amaniss, A., Hermann, M., Lugiez, D. (1997). Set operations for recurrent term schematizations. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030608
Download citation
DOI: https://doi.org/10.1007/BFb0030608
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive