378 search results - page 13 / 76 » Higher-order transformation of logic programs |
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
LISP
2007
14 years 9 months ago
2007
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
107
Voted
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
114
click to vote
AGP
2010
IEEE
15 years 1 months ago
2010
IEEE
We present an overview of the program transformation techniques which have been proposed over the past twenty-five years in the context of logic programming. We consider the appro...