Towards a Generic Trace for Rule Based Constraint Reasoning

Abstract : 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 testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information. In this report, we propose a new trace for CHR which contains enough information to analyze any aspects of \CHRv\ execution at some useful abstract level, common to several implementations. %a large family of rule based solvers. This approach is based on the idea of generic trace. Such a trace is formally defined as an extension of the $\omega_r^\lor$ semantics of CHR. We show that it can be derived form the SWI Prolog CHR trace.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/hal-00690604
Contributor : Pierre Deransart <>
Submitted on : Tuesday, April 24, 2012 - 1:09:55 AM
Last modification on : Tuesday, May 14, 2019 - 10:13:49 AM
Long-term archiving on : Wednesday, July 25, 2012 - 2:21:12 AM

Files

RR-7939.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00690604, version 1
  • ARXIV : 1204.5280

Citation

Armando Gonçalves da Silva Junior, Pierre Deransart, Luis-Carlos Menezes, Marcos-Aurélio Almeida da Silva, Jacques Robin. Towards a Generic Trace for Rule Based Constraint Reasoning. [Research Report] RR-7939, INRIA. 2012, pp.42. ⟨hal-00690604⟩

Share

Metrics

Record views

613

Files downloads

1584