DocumentCode
2357209
Title
Set constraints with projections are in NEXPTIME
Author
Charatonik, Witold ; Pacholski, Leszek
Author_Institution
Warsaw Univ., Poland
fYear
1994
fDate
20-22 Nov 1994
Firstpage
642
Lastpage
653
Abstract
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper we prove that the problem of existence of a solution of a system of set constraints with projections is in NEXPTIME, and thus that it is NEXPTIME-complete. This extends the result of A. Aiken, D. Kozen, and E.L. Wimmers (1993) and R. Gilleron, S. Tison, and M. Tommasi (1990) on decidability of negated set constraints and solves a problem that was open for several years
Keywords
computability; computational complexity; decidability; inference mechanisms; NEXPTIME; decidability; negated set constraints; program analysis; projections; set constraints; type inference; Algorithm design and analysis; Automata; Computer science; Constraint theory; Inference algorithms; Logic programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Conference_Location
Santa Fe, NM
Print_ISBN
0-8186-6580-7
Type
conf
DOI
10.1109/SFCS.1994.365727
Filename
365727
Link To Document