Tarskian set constraints are in NEXPTTME

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 589-596

  Mielniczuk, Pawel ^a   Pacholski, Leszek ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EXPONENTIAL TIME; RECURSIONS; SATISFIABILITY; SET CONSTRAINTS; TARSKIAN;

ARTIFICIAL INTELLIGENCE;

EID: 84896740652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055809     Document Type: Conference Paper

References (19)

1. A. Aiken, D. Kozen, M. Vaxdi, and E. L. Wimmers. The complexity of set constraints. In Computer Science Logic'93, LNCS 832, pages 1-17. Springer-Verlag, 1994.
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.
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.
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.
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.
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.
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.
8. th Symp. on Foundations of Computer Science, pages 372-380, 1993
9. A full version Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille.
10. 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.
11. 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.
12. 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.
13. 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.
14. D. A. McAllester and R. Givan. Taxonomic syntax for first order inference. Journal of ACM, 40:346-283, 1993.
15. th Annual IEEE Symposium on Logic in Computer Science, pages 138-147, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
16. P. Mishra and U. Reddy. Declaration-free type checking. In Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7-21, 1985.
17. J. C. Reynolds. Automatic computation of data set definitions. Information Processing, 68:456-461, 1969.
18. 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.
19. 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.