662 search results - page 78 / 133 » Logic Programming with Ordered Disjunction |
CSL
2008
Springer
13 years 10 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
ESOP
2003
Springer
14 years 2 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
ICLP
1994
Springer
14 years 29 days ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
ECP
1997
Springer
14 years 1 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...