LOPSTR
2009
Springer
14 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 ...
LOPSTR
2009
Springer
14 years 5 months ago
2009
Springer
LOPSTR
2009
Springer
14 years 7 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
LOPSTR
2009
Springer
14 years 7 months ago
2009
Springer
LOPSTR
2009
Springer
14 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
2009
Springer
14 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...
LOPSTR
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
LOPSTR
2009
Springer
14 years 7 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
LOPSTR
2009
Springer
14 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 ...
LOPSTR
2009
Springer
14 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 ...