Sciweavers

LOPSTR
2009
Springer
13 years 8 months ago
Towards a Framework for Constraint-Based Test Case Generation
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 ...
François Degrave, Tom Schrijvers, Wim Vanho...
LOPSTR
2009
Springer
13 years 8 months ago
Defining Datalog in Rewriting Logic
María Alpuente, Marco A. Feliú, Chri...
LOPSTR
2009
Springer
13 years 10 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
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...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
LOPSTR
2009
Springer
13 years 10 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
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...
José Iborra, Naoki Nishida, Germán V...
LOPSTR
2009
Springer
13 years 10 months ago
The Dependency Triple Framework for Termination of Logic Programs
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...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
LOPSTR
2009
Springer
13 years 10 months ago
Using Rewrite Strategies for Testing BUpL Agents
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...
Lacramioara Astefanoaei, Frank S. de Boer, M. Birn...
LOPSTR
2009
Springer
13 years 10 months ago
LP with Flexible Grouping and Aggregates Using Modes
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...
Marcin Czenko, Sandro Etalle
LOPSTR
2009
Springer
13 years 10 months ago
Coinductive Logic Programming with Negation
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 ...
Richard Min, Gopal Gupta
LOPSTR
2009
Springer
13 years 10 months ago
Deciding Full Branching Time Logic by Program Transformation
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 ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...