155
Voted
LOPSTR
15 years 7 months ago
2009 Springer 
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
111
Voted
LOPSTR
15 years 7 months ago
2009 Springer 
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
107
click to vote
LOPSTR
15 years 7 months ago
2009 Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
LOPSTR
15 years 5 months ago
2009 Springer 
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
108
Voted
LOPSTR
15 years 7 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 ...
|
Automated Reasoning