241 search results - page 25 / 49 » Bounded Nondeterminism of Logic Programs |
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
POPL
2000
ACM
14 years 22 hour ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
ESOP
2003
Springer
14 years 26 days ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
IBERAMIA
2010
Springer
13 years 5 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...