4513 search results - page 385 / 903 » Logic programming with satisfiability |
129
Voted
IWFM
2003
15 years 6 months ago
2003
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
158
click to vote
ENTCS
2002
15 years 4 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...
202
click to vote
ICLP
2011
Springer
14 years 8 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...
131
Voted
ESOP
2003
Springer
15 years 10 months 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 ...
147
Voted
ESOP
1998
Springer
15 years 9 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...