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 produced by different implementations of a software component and used independently from the traced component. This approach is used to define a method for extending a java based CHR platform called CHROME (Constraint Handling Rule Online Model-driven Engine) with an extensible generic tracer. The method includes a tracer specification in SFC, a methodology to extend it, and the way to integrate it with CHROME, resulting in the platform CHROME-REF (for Reasoning Explanation Facilities), which is a constraint solving and rule based reasoning engine with explanatory traces. Key-words: Trace, CHR, CHR, CHROME, CHROME-REF, Tracer, MetaTheory, Model Driven Engineering, Tracer Driver, Analysis Tool, Program Analysis, Observational Semantics, Software Component, Debugging, Programming Environment, Logic Programming, Validation ∗ INRIA Paris-Rocquencourt, [email protected] † Work done during internship of Rafael Oliveira from ‡ Federal University of Pernambuco, [email protected] Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning Résumé : Dans ce rapport, nous montrons comment utiliser le calcul des fluents simple (SFC) pour spécifier des traceurs génériques, c’est-à-dire qui produisent des traces génériques. Une trace générique est une trace qui peut être produite par différentes implémentations d’un composant logiciel et être utilisées indépendamment du composant tracé. Cette approche est utilisée pour définir une méthode pour introduire dans une platforme CHR basée Java et appelée CHROME (Constraint Handling Rule Online Model-driven Engine) un traceur générique extensible. La méthode comprend une spécification du traceur en SFC, une méthodologie d’extension, et leur implantation dans CHROME, afin d’obtenir la plateforme CHROME-REF (Raisonnement Explicatif Facilité), qui est un solveur de contraintes et moteur de raisonnement à base de règles avec des traces d’explications. Mots-clés : trace, CHR, CHR, CHROME, CHROME-REF, MDE, traceur, méta-théorie, pilote de tracer, analyseur, outils d’analyse, analyse de programme, analyse dynamique, sémantique observationnelle, composant logiciel, déboggage, environnement de programmation, programmation en logique, validation Towards a Generic Framework 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing E-SHIQ Distributed Knowledge Bases via Ontology Modularization: The mONTul method

This article presents a reconfigurable method for the modularization of SHIQ ontologies, towards the construction of distributed E − SHIQ knowledge bases. The aim is to compute decompositions for correct, complete and efficient distributed reasoning. The proposed method combines graph-based modularization techniques with localitybased rules using a generic constraint problem solving framework. ...

متن کامل

A Uniied Framework for Solving Boolean, Integer and Set Constraints

In this short paper, a uniied framework for solving Boolean, integer and set constraints is presented. The computation model for solving conjunctions of primitive constraints, possibly with existential and universal quantiications, is described using rewrite rules. An important feature of the constraint solving model is that a variable's domain (set of integers) can be a constrained variable (s...

متن کامل

AKTive Workgroup Builder (AWB): Constraint Satisfaction Problem Solving over the Semantic Web

In this paper we introduce the AKTive Workgroup Builder (AWB) web application and describe how it uses distributed RDF data, defined against an OWL Lite ontology, to build and solve a user defined Constraint Satisfaction Problem (CSP). We describe our approach to mixed mode reasoning using both ontological and rule based methods and discuss how some of the factors relating to this affect the de...

متن کامل

A Hybrid Learning Model of Abductive Reasoning

Multicausal abductive tasks appear to have deliberate and implicit components: people generate and modify explanations using a series of recognizable steps, but these steps appear to be guided by an implicit hypothesis evaluation process. This paper proposes a hybrid symbolic-connectionist learning architecture for multicausal abduction. The architecture tightly integrates a symbolic Soar model...

متن کامل

Fuzzy Rules in Case-based Reasoning

Similarity-based fuzzy rules are proposed as a basic tool for modelling and formalizing parts of the case-based reasoning methodology within the framework of approximate reasoning. The use of diierent types of rules for encoding the heuristic reasoning principle underlying case-based problem solving is discussed, which leads to diierent approaches to case-based inference. A model which combines...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1001.2188  شماره 

صفحات  -

تاریخ انتشار 2010