TPHOLs 2004: Theorem Proving in Higher Order Logics pp 321-336 | Cite as
Term Algebras with Length Function and Bounded Quantifier Alternation
Conference paper
Abstract
Term algebras have wide applicability in computer science. Unfortunately, the decision problem for term algebras has a nonelementary lower bound, which makes the theory and any extension of it intractable in practice. However, it is often more appropriate to consider the bounded class, in which formulae can have arbitrarily long sequences of quantifiers but the quantifier alternation depth is bounded. In this paper we present new quantifier elimination procedures for the first-order theory of term algebras and for its extension with integer arithmetic. The elimination procedures deal with a block of quantifiers of the same type in one step. We show that for the bounded class of at most k quantifier alternations, regardless of the total number of quantifiers, the complexity of our procedures is k-fold exponential (resp. 2k fold exponential) for the theory of term algebras (resp. for the extended theory with integers).
Preview
Unable to display preview. Download preview PDF.
References
- 1.Backofen, R.: A complete axiomatization of a theory with feature and arity constraints. Journal of Logical Programming 24(1&2), 37–71 (1995)MATHCrossRefMathSciNetGoogle Scholar
- 2.Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation 112(2), 167–216 (1994)MATHCrossRefMathSciNetGoogle Scholar
- 3.Comon, H., Lescanne, P.: Equational problems and disuniication. Journal of Symbolic Computation 7, 371–425 (1989)MATHCrossRefMathSciNetGoogle Scholar
- 4.Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic 48, 1–79 (1990)MATHCrossRefMathSciNetGoogle Scholar
- 5.Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Machine Intelligence, vol. 7, pp. 91–99. American Elsevier (1972)Google Scholar
- 6.Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, London (2001)MATHGoogle Scholar
- 7.Ferrante, J., Rackoff, C.W.: The Computational Complexity of Logical Theories. Springer, Heidelberg (1979)MATHGoogle Scholar
- 8.Furer, M.: The complexity of Presburger arithmetic with bounded quantifer alternation depth. Theoretical Computer Science 18, 105–111 (1982)CrossRefMathSciNetGoogle Scholar
- 9.Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)MATHCrossRefGoogle Scholar
- 10.Korovin, K., Voronkov, A.: A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering. In: Proceedings of 15th IEEE Symposium on Logic in Computer Science, pp. 291–302. IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
- 11.Korovin, K., Voronkov, A.: Knuth-Bendix constraint solving is NP-complete. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 979–992. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 12.Kuncak, V., Rinard, M.: On the theory of structural subtyping. Technical Report MIT-LCS-TR-879, Massachusetts Institute of Technology (January 2003)Google Scholar
- 13.Kuncak, V., Rinard, M.: The structural subtyping of non-recursive types is decidable. In: Proceedings of 18th IEEE Symposium on Logic in Computer Science, pp. 96–107. IEEE Computer Society Press, Los Alamitos (2003)CrossRefGoogle Scholar
- 14.Kunen, K.: Negation in logic programming. Journal of Logic Programming 4(4), 289–308 (1987)MATHCrossRefMathSciNetGoogle Scholar
- 15.Lovasz, L.: Combinatorial Problems and Exercises. Elsevier, Horth-Holland (1993)MATHGoogle Scholar
- 16.Maher, M.J.: Complete axiomatizations of the algebras of finite, rational and infinite tree. In: Proceedings of the 3rd IEEE Symposium on Logic in Computer Science, pp. 348–357. IEEE Computer Society Press, Los Alamitos (1988)Google Scholar
- 17.Mal’cev, A.I.: Axiomatizable classes of locally free algebras of various types. In: The Metamathematics of Algebraic Systems, Collected Papers, ch. 23, pp. 262–281. North Holland, Amsterdam (1971)Google Scholar
- 18.Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4(2), 258–282 (1982)MATHCrossRefGoogle Scholar
- 19.Oppen, D.C.: Reasoning about recursively defined data structures. Journal of ACM 27(3) (July 1980)Google Scholar
- 20.Reddy, C.R., Loveland, D.W.: Presburger arithmetic with bounded quantifier alternation. In: Proceedings of the 10th Annual Symposium on Theory of Computing, pp. 320–325. ACM Press, New York (1978)CrossRefGoogle Scholar
- 21.Rybina, T., Voronkov, A.: A decision procedure for term algebras with queues. ACM Transactions on Computational Logic 2(2), 155–181 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 22.Vorobyov, S.: An improved lower bound for the elementary theories of trees. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 275–287. Springer, Heidelberg (1996)Google Scholar
- 23.Zhang, T., Sipma, H., Manna, Z.: The decidability of the first-order theory of term algebras with Knuth-Bendix order (2004) (submitted)Google Scholar
- 24.Zhang, T., Sipma, H., Manna, Z.: Decision procedures for recursive data structures with integer constraints. To appear in the Proceedings of the 2nd International Joint Conference on Automated Reasoning (2004)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2004