5 citations · 12 across the 10 of their papers we have counts for
10 papers
Towards a Generic Trace for Rule Based Constraint Reasoning
Armando Gonçalves Da Silva Junior, Pierre Deransart, Luis-Carlos Menezes +2
CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their t…
Generic Traces and Constraints, GenTra4CP revisited
Pierre Deransart
The generic trace format GenTra4CP has been defined in 2004 with the goal of becoming a standard trace format for the observation of constraint solvers over finite domains. It has…
Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning
Pierre Deransart, Rafael Oliveira
In this report, we show how to use the Simple Fluent Calculus (SFC) to specify generic tracers, i.e. tracers which produce a generic trace. A generic trace is a trace which can be…
Observational semantics of the Prolog Resolution Box Model
Pierre Deransart, Mireille Ducassé, Gérard Ferrand
This paper specifies an observational semantics and gives an original presentation of the Byrd box model. The approach accounts for the semantics of Prolog tracers independently of…
On using Tracer Driver for External Dynamic Process Observation
Pierre Deransart
One is interested here in the observation of dynamic processes starting from the traces which they leave or those that one makes them produce. It is considered here that it should…
Rigorous design of tracers: an experiment for constraint logic programming
Mireille Ducasse, Ludovic Langevine, Pierre Deransart
In order to design and implement tracers, one must decide what exactly to trace and how to produce this trace. On the one hand, trace designs are too often guided by implementation…