275 search results - page 39 / 55 » Non-Termination Inference of Logic Programs |
IJCAI
1993
14 years 11 months ago
1993
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
143
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
LOGCOM
2010
14 years 8 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 ...
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...