223 search results - page 42 / 45 » Logic programs with monotone abstract constraint atoms |
132
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
156
click to vote
FCT
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
138
click to vote
LICS
1992
IEEE
15 years 10 months ago
1992
IEEE
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
202
click to vote
LICS
2009
IEEE
16 years 19 days ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
152
click to vote
CPAIOR
2009
Springer
16 years 17 days ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...