W. Charatonik and L. Pacholski, "Negative Set Constraints: an Easy Proof of Decidability", Proc. 9 th IEEE Symp. on Logic in Computer Science, 1994, to appear.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....i.e. the extension to positve constraints with negations of subset relationships such as se 1 6 se 2 , remains decidable. Once again, tree automata techniques were used here. An alternative procedure was then given by [4] by reduction to a number theoretic decision problem. Subsequently, [6] used the abovementioned translation of set constraints to the monadic class to provide a straightforward procedure for deciding negative set constraints. Note that none of these works on negative constraints deal with projections. In summary, the state of the art for the set constraint decision ....

....the state of the art for the set constraint decision problem is largely determined by the reduction to the monadic class of formulas. The main question remains how to deal with (unrestricted) projection. At the time of writing, we have verbal communication [26] indicating that the proof in [6] can be extended to solve this problem. Thus the question of whether the general set constraint problem is open, now becomes open 2.3 Applications Early works Two important early works are by Jones and Muchnick [22] and Reynolds [29] In [22] an analysis is described for an imperative language ....

W. Charatonik and L. Pacholski, "Negative Set Constraints: an Easy Proof of Decidability", Proc. 9 th IEEE Symp. on Logic in Computer Science, 1994, to appear.

No context found.

W. Charatonik and L. Pacholski. Negative set constraints: an easy proof of decidability. Technical Report MPI-I-93-265, Max-Planck Institute fur Informatik, December 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC