Tessier, A., Declarative Debugging in Constraint Logic Programming: the Cover Relation. Technical Report 96/09, LIFO, University of Orl'eans, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....GAPLog, which use external definitions. 2. 4 Constraint logic programming languages A subject closely related to debugging of functional logic programs is debugging of constraint logic programs [11] So far, this is a quite unresearched field, but recently research have started in this field too [12, 26]. 8 CHAPTER 2. RELATED WORK Chapter 3 Preliminaries 3.1 GAPLog GAPLog [15] is a functional logic programming language with the following properties: ffl The functional component of the language is not fixed. Functions in a program are imported from an external program, written in a ....

Alexandre Tessier. Declarative Debugging in Constraint Logic Programming: the Cover Relation. Technical Report 96/09, LIFO, University of Orl'eans, 1996.

....in the program. A more systematic technique for locating errors is declarative or algorithmic debugging proposed in [Sha82] for logic programs (see also [Fer87, Llo87a] More recently declarative debugging was extended for lazy functional programming [NF94] and constraint logic programming [Tes96]. Declarative debugging allows to abstract from details of the program execution and focuses on the declarative semantics. In this approach the execution which shows a symptom of an error is analyzed interactively by a semi automatic system. The user is queried about elements of relations or ....

A. Tessier. Declarative debugging in constraint logic programming. In Asian Computing Science Conf., LNCS. Springer-- Verlag, December 1996. BIBLIOGRAPHY 75

....to the complexity of the operational semantics of such programs, the information obtained by tracing the execution is difficult to understand. The alternative idea of declarative diagnosis, proposed for logic programs (see e.g. 19, 14, 17] is applicable also in the case of constraint programs [16, 20]. However, the declarative diagnosis algorithms assume that the user is able to answer queries whether or not certain intermediate results of the computation correspond to her expectations. In practice, such questions may be very complex and virtually impossible to answer. We believe that this ....

....the number of skeletons is infinite. A natural choice would be to check satisfiability after adding every new instance of a clause to the existing skeletons. However, in general there may be no complete algorithms for checking satisfiability of constraints in a given constraint domain. Following [20] this can be abstracted as an assumption that there is some sufficient condition for unsatisfiability to be called the reject criterion. This is an abstraction for a spectrum of behaviours. An reject criterion operational semantics of a program can now be defined in terms of skeletons, using ....

[Article contains additional citation context not shown here]

Alexandre Tessier. Declarative debugging in constraint logic programming. In Joxan Jaffar, editor, Asian Computing Science Conference, volume 1179 of Lecture Notes in Computer Science, pages 64--73. Springer-Verlag, 1996.

....diagnosis, a computed answer cannot be considered alone. We have to consider the set (or a subset) of computed answers. We cannot limit exploration to a single skeleton. An error is rather a non completely covered constrained atom [3] than a non covered constrained atoms [4] as shown in [9]. ....

Tessier, A., Declarative Debugging in Constraint Logic Programming: the Cover Relation. Technical Report 96/09, LIFO, University of Orl'eans, 1996.

....case corresponds to F W S2Z V c2S c is valid in D. A negative cover is consequence of a constraint theory T if it is valid in each model D of T . The notion of negative cover, when each store of Z is finite, corresponds to the usual notion of cover in the classical completeness theorems [11, 9, 18]. A positive cover is a pair S F , where F is a formula over the constraint language and S is a store. A positive cover S F is valid in the pre interpretation D if for each solution v of S: v is a solution of F . The finite case corresponds to V c2S c F is valid in D. A positive cover is ....

Alexandre Tessier. Declarative Debugging in Constraint Logic Programming. In Joxan Jaffar, editor, Asian Computing Science Conference, volume 1179 of Lecture Notes in Computer Science, pages 64--73. Springer-Verlag, 1996.

....declarative diagnosis part of the DiSCiPl project. We prefer to show in this deliverable another approach based on a negative semantics of the program and called negative partial incorrectness. For a detailed comparison between positive partial insufficiency and negative partial incorrectness see [26]. 5 Negative Side (Negative Diagnosis) At the negative level, we consider formulae of the form 8(b c 1 Delta Delta Delta c n ) b 2 BODY , fc 1 ; c n g STORE) 5.1 Negative Computation (SLD tree) Definition 14 Let r be a computation rule and p 2 Pi. Let , p r be the binary ....

....negative symptoms. As for the positive case, each strategy can be considered: top down, bottomup, divide and query, etc. The novel framework (negative proof trees and incorrectness diagnosis for missing answers) define a wide family of algorithms for negative diagnosis. The algorithm proposed in [26] is a member of this family and is a lifting of the algorithm proposed in [5] for pure logic programs. But the family of diagnosers described by the novel framework is more general: ffl they relax the requirement of the existence of a finite standard SLD tree and replace it by the existence of a ....

[Article contains additional citation context not shown here]

A. Tessier. Declarative Debugging in Constraint Logic Programming. In J. Jaffar, editor, Asian Computing Science Conference, volume 1179 of Lecture Notes in Computer Science, pages 64--73. Springer-Verlag,

....on its scheme. 41] provide a formal inductive framework based on the grammatical view [12] in order to extend declarative diagnosis to CLP. 22] wrong answers) abstracts the constraint interpretation by a reject criterion in order to take into account incompleteness of the constraint solver. [40] (missing answers) extends the reject criterion to a cover relation and defines insufficiency and weak insufficiency in a unique inductive framework. Another point is the presentation problem [26] which is concerned with finding ways of presenting large and complex oracle queries in such a way ....

A. Tessier. Declarative Debugging in Constraint Logic Programming. In J. Jaffar, editor, Asian Computing Science Conference, volume 1023 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....(or incompleteness symptom) This particular case corresponds to the existence of a finite SLD tree for the goal concerning the symptom atom. Lemma 4.3 If a[c] is a computed symptom then a[c] is an insufficiency symptom. Proof. The proof needs to define SLD tree which is out of scope (see [20]) It fully uses induction and properties; it is based on the following lemmas: 1. If there exists a finite SLD tree for the goal a with success c 1 ; c m then there exists an integer k such that, for each constraint c, if a[c] 2 T P # k then c ; or c 2 fc 1 ; c m g. 2. For ....

A. Tessier. Declarative Debugging in Constraint Logic Programming: the Cover Relation. Technical Report 96/09, LIFO, University of Orl'eans, 1996.

....D. Une couverture n egative est cons equence d une th eorie des contraintes T si elle est valide dans tous les mod eles de T . La notion de couverture n egative quand tous les stores de Z sont finis correspond a la notion habituelle de couverture dans les th eor emes de compl etude classiques [18, 13, 25]. Une couverture positive est un couple S F , o u F est une formule du langage des contraintes et S est un store. Une couverture positive S F est valide dans une pr einterpr etation D si pour toute solution v de S : v est solution de F . Le cas fini correspond a V c2S c F valide dans D. ....

Alexandre Tessier. Declarative Debugging in Constraint Logic Programming. In Joxan Jaffar, editor, Asian Computing Science Conference, volume 1179 of Lecture Notes in Computer Science, pages 64--73. Springer-Verlag, 1996.

....relation. Our approach gives a new framework to understand and to generalize the algorithm of [4, 14] to what extent it depends on the standard computation rule and how it can be generalized to CLP) The paper is only devoted to the theoretical basis of the approach. An example is developed in [19]. The justifications were not given in this previous paper, they are now given in the present paper. 2 Operational Semantics Let us consider once and for all four sets which define the program language: an infinite set of variables V ; a set of function symbols Sigma; a set of constraint ....

....covered. Lemma 33 If there exists a negative incorrectness symptom then there exists a negative incorrectness. Note that the definition of negative incorrectness symptom and negative incorrectness are identical to the definition of incompleteness symptom and weak insufficiency given in [19] (in [19] they are compared with the definition of insufficiency symptom and strong insufficiency) The novel framework (negative computation and diagnosis wrt a well founded relation) define a wide family of algorithms for negative incorrectness diagnosis. The algorithm proposed in [19] is a ....

[Article contains additional citation context not shown here]

A. Tessier. Declarative Debugging in Constraint Logic Programming. In J. Jaffar, editor, Asian Computing Science Conference, volume 1179 of Lecture Notes in Computer Science, pages 64--73. Springer-Verlag, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC