Advertisement

Tarskian set constraints are in NEXPTIME

  • Pawel Mielniczuk
  • Leszek Pacholski
Contributed Papers Turing Complexity and Logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)

Abstract

In this paper we show that satisfiability of Tarskian set constraints (without recursion) can be decided in exponential time. This closes the gap left open by D.A. McAllester, R. Givan, C. Witty and D. Kozen in [14].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Aiken, D. Kozen, M. Vardi, and E. L. Wimmers. The complexity of set constraints. In Computer Science Logic'93, LNCS 832, pages 1–17. Springer-Verlag, 1994.Google Scholar
  2. 2.
    A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of systems of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, June 1993.Google Scholar
  3. 3.
    A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279–290, January 1991.Google Scholar
  4. 4.
    A. Aiken and E. L. Wimmers. Solving systems of set constraints (extended abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, pages 329–340, 1992.Google Scholar
  5. 5.
    L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Eight Annual IEEE Symposium on Logic in Computer Science, pages 75–83, 1993.Google Scholar
  6. 6.
    W. Charatonik and L. Pacholski. Set constraints with projections are in nexptime. In 35th Annual IEEE Symposium on Foundations of Computer Science, pages 642–653, November 1994.Google Scholar
  7. 7.
    R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In 10th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 665, pages 505–514. Springer-Verlag, 1993.Google Scholar
  8. 8.
    R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proceedings of the 34th Symp. on Foundations of Computer Science, pages 372–380, 1993. A full version Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille.Google Scholar
  9. 9.
    D. Givan, R. McAllester. New results on local inference relations. In M. K. Press, editor, Principles of Knowledge representation and Reasoning: Proceedings of the Third International Conference, pages 403–412, 1992.Google Scholar
  10. 10.
    N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 42–51, 1990.Google Scholar
  11. 11.
    N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197–209, January 1990.Google Scholar
  12. 12.
    N. D. Jones and S. S. Muchnick. Flow analysis and optimization of lisp-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244–256, January 1979.Google Scholar
  13. 13.
    D. A. McAllester and R. Givan. Taxonomic syntax for first order inference. Journal of ACM, 40:346–283, 1993.MathSciNetGoogle Scholar
  14. 14.
    D. A. McAllester, R. Givan, C. Witty, and D. Kozen. Tarskian set constraints. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 138–147, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.Google Scholar
  15. 15.
    P. Mishra and U. Reddy. Declaration-free type checking. In Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7–21, 1985.Google Scholar
  16. 16.
    J. C. Reynolds. Automatic computation of data set definitions. Information Processing, 68:456–461, 1969.Google Scholar
  17. 17.
    K. Stefansson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 137–141, 1994.Google Scholar
  18. 18.
    J. Young and P. O'Keefe. Experience with a type evaluator. In D. BjØrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573–581. North-Holland, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Pawel Mielniczuk
    • 1
  • Leszek Pacholski
    • 1
  1. 1.Institute of Computer ScienceUniversity of WroclawUSA

Personalised recommendations