1. S. Mallet and M. Ducassé. An Informal Presentation of DDB Trees: A Basis for Deductive Database Explanations. In Ulrich Geske, editor, DDLP'97, Fifth International Workshop on Deductive Databases and Logic Programming, July 1997. GMD-Studien. Keyword(s): debugging, explanations, deductive databases, logic programming.
   

   @InProceedings{mallet97b,
   Author = {S. Mallet and M. Ducassé},
   Title = {An {I}nformal {P}resentation of {DDB} {T}rees: {A} {B}asis for {D}eductive {D}atabase {E}xplanations},
   BookTitle = {DDLP'97, Fifth International Workshop on Deductive Databases and Logic Programming},
   Year = {1997},
   Editor = {Ulrich Geske},
   Publisher = {GMD-Studien},
   Month = {July},
   Keywords = {debugging, explanations, deductive databases, logic programming},
   
   }
   




2. S. Mallet and M. Ducassé. DDB trees: a basis for deductive database explanations. In Mariam Kamkar, editor, AADEBUG'97,Third International Workshop on Automated Debugging, Linköping, Sweden, pages 87-102, May 1997. [WWW] Keyword(s): debugging, explanations, deductive databases, logic programming. Abstract:

   The power of deductive systems in general is that programs express what should be done and not how it should be done. Nevertheless, deductive systems need debugging and explanation facilities. Indeed, their operational semantics is less abstract than the declarative semantics of the programs. If users have to understand all the low level details of the operational semantics much of the benefits of using a deductive system is lost. Existing explanation systems for deductive databases produce proof trees to be shown to users. Although useful, proof trees give a fragmented view of query evaluations, and users face a, most of the time large, forest of proof trees. We propose a new data structure, called the DDB tree, which merges the information of a proof tree forest into one concise tree. A DDB tree gives a global picture of a query evaluation in a dramatically reduced structure with no loss of information. DDB trees can be shown to users or can be analyzed further by an explanation system.

   
   

   @InProceedings{mallet97a,
   Author = {S. Mallet and M. Ducassé},
   Title = {{DDB} trees: a basis for deductive database explanations},
   BookTitle = {AADEBUG'97,Third International Workshop on Automated Debugging},
   Year = 1997,
   Editor = {Mariam Kamkar},
   Pages = {87-102},
   Address = {Link\"{o}ping, Sweden},
   Month = {May},
   Location = {mireille},
   Url = {http://www.ep.liu.se/ea/cis/1997/009/09/ },
   Keywords = {debugging, explanations, deductive databases, logic programming},
   Abstract = {The power of deductive systems in general is that programs express what should be done and not how it should be done. Nevertheless, deductive systems need debugging and explanation facilities. Indeed, their operational semantics is less abstract than the declarative semantics of the programs. If users have to understand all the low level details of the operational semantics much of the benefits of using a deductive system is lost. Existing explanation systems for deductive databases produce proof trees to be shown to users. Although useful, proof trees give a fragmented view of query evaluations, and users face a, most of the time large, forest of proof trees. We propose a new data structure, called the DDB tree, which merges the information of a proof tree forest into one concise tree. A DDB tree gives a global picture of a query evaluation in a dramatically reduced structure with no loss of information. DDB trees can be shown to users or can be analyzed further by an explanation system.} 
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html