850 search results - page 134 / 170 » A Logic Programming Language Based on Binding Algebras |
119
click to vote
LOGCOM
2010
14 years 11 months ago
2010
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
ECOOP
2008
Springer
15 years 3 months ago
2008
Springer
Rather than upgrading a software system to the next version by installing a new binary, software systems could be updated "on-thefly" during their execution. We are devel...
108
click to vote
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
102
click to vote
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
107
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...