Abstract
We discuss the existential fragments of two theories of concatenation. These theories describe concatenation of possibly nested lists in the algebra of finite trees with lists and in the algebra of rational trees with lists. Syntax and the choice of models are motivated by the treatment of lists in PROLOG III. In a recent prototype of this language, Colmerauer has integrated a built-in concatenation of lists, and the constraint-solver checks satisfiability of equations and disequations over concatenated lists. But, for efficiency reasons satisfiability is only tested in a rather approximative way. The question arises whether satisfiability is decidable. Our main results are the following. For the algebra of finite trees with lists, the existential fragment of the theory is decidable. For the algebra of rational trees with lists, the positive existential fragment of the theory is decidable. Problems in the treatment of the existential fragment may be traced back to a difficult question about solvability of word equations with length constraints for variables.
Supported by EC Working Group CCL, EP 6028.
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings of CADE-11, Springer LNCS 607, 1992.
F. Baader and K.U. Schulz, “Combination Techniques and Decision Problems for Disunification,” (extended version) DFKI Research-Report-93-05, German Research Center for AI, Saarbrücken 1993. Short version in Proceedings RTA '93, Montreal, June 1993, LNCS 690. Springer, 1993, pp.301–315.
J.R. Büchi, S. Senger, “Coding in the Existential Theory of Concatenation,” Arch. math. Logik 26 (1986/7), pp.101–106.
A. Colmerauer, “Equations and Inequations on Finite and Infinite Trees,” Proceedings of the FGCS'84, pp.85–99.
A. Kościelski, L. Pacholski, “Complexity of Makanin's Algorithms,” Research Report, Universitiy of Wroclaw (1991); preliminary version: “Complexity of Unification in Free Groups and Free Semi-Groups,” Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, Los Alamos (1990), pp.824–829.
M.J. Maher, “Complete axiomatizations of the algebras of finite, rational and infinite trees”, In Proc. LICS 3, IEEE Computer Society (1988), pp.348–357.
G.S. Makanin, “The Problem of Solvability of Equations in a Free Semigroup,” Mat. USSR Sbornik 32, 1977.
G.S. Makanin, “Equations in a Free Group”, Izv. Akad. Nauk SSSR Ser. Mat. 46 (1982), 1199–1273; English Translation in Math. USSR Izv. 21 (1983).
W.V. Quine, “Concatenation as a Basis for Arithmetic,” J. Symbolic Logic 11 (1946), pp.105–114.
K.U. Schulz, “Constraints for Lists and Theories of Concatenation” CIS-Report 94-80, Univ. of Munich, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, K.U. (1995). On existential theories of list concatenation. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022264
Download citation
DOI: https://doi.org/10.1007/BFb0022264
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60017-6
Online ISBN: 978-3-540-49404-1
eBook Packages: Springer Book Archive