Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive set constraints have appeared. In this paper we consider systems of mixed positive and negative constraints, which are considerably more expressive than positive constraints alone. We show that it is decidable whether a given such system has a solution. The proof involves a reduction to a number-theoretic decision problem that may be of independent interest. © 1995 Academic Press, Inc.
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science