700 search results - page 89 / 140 » On Termination of Constraint Logic Programs |
168
click to vote
POPL
2009
ACM
15 years 11 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
161
click to vote
POPL
2005
ACM
15 years 11 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
108
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
PRICAI
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
LPNMR
2005
Springer
15 years 4 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...