3470 search results - page 179 / 694 » Head-Elementary-Set-Free Logic Programs |
179
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
234
click to vote
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
181
click to vote
ESOP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
197
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
174
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...