Pereira, L., and Calejo, M. A framework for Prolog debugging. In R.A. Kowalski and K.A. Bowen (Eds.), Logic Programming, Volume 1, MIT Press, pp. 481-495, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the display for every clause head means that the user inevitably runs out of available screen space on large programs. We deal with this horizon effect in section 2.1. There has been other work on more declarative approaches to debugging Prolog (e.g. Shapiro, 1982; Lloyd, 1986; Pereira, 1986; Pereira and Calejo, 1988). This work has been based on the declarative reading of Prolog, and not on procedural tracing as such. For this reason the work is not reviewed in detail here. For further information on combining the two debugging styles see (Ducasse, 1988; Brayshaw, 1990) A brief description of mixed ....

Pereira, L., and Calejo, M. A framework for Prolog debugging. In R.A. Kowalski and K.A. Bowen (Eds.), Logic Programming, Volume 1, MIT Press, pp. 481-495, 1988.

....related to executions, the algorithm depending on the symptom. Most systems use mainly the proof tree, but Naish in a recent article came up with a framework which can model executions with other types of trees depending on the symptom [Naish, 1997] The Rational Debugging system [Pereira, 1986, Pereira Calejo, 1988] uses two heuristics to select events which are very close to our instantiation prole and our leaf failure tracking. The expert systems explanation tools of [Saurel, 1987] and [Yalcinalp, 1991] are also very close to our leaf failure tracking. The main problem of these tools is that they are ....

L.M. Pereira and M.C. Calejo. (1988). A framework for Prolog debugging. In Kowalski and Bowen [Kowalski & Bowen, 1988]. JICSLP'88.

....declarative debugger is modified to examine whether the use of the construct has been declarative. If it has not the debugger aborts, otherwise it is treated in a logical way. In [35] Nadjm Tehrani discusses a general overview of the previous work. Pereira and Calejo s work ( 5] 44] 46] and [45]) mostly concentrate on modifying declarative debugging techniques to cope with the pseudo declarative and non declarative features of Prolog. In [44] Pereira provides a debugger which is more suitable for practical debugging of Prolog than Shapiro s as it provides the notion of inadmissible ....

L. M. Pereira and M. Calejo. A framework for Prolog debugging. In Kowalski and Bowen [27], pages 481--495. Bibliography 125

....about the operational aspect of the program. All that they need to know is the intended interpretation of the program. The quantity of the queries imposed on the oracle may be large and reducing the quantity of the queries has been the main objective of much research into declarative diagnosis [4, 2, 3, 15, 16]. The quantity of the queries is dependent on the size of the search space and the search strategy [18, 9] This paper formalises the programmer s practice of using assertions about the correctness of the program and uses two kinds of correctness assertion to reduce the size of the search space of ....

L.M. Pereira and M. Calejo. A framework for Prolog debugging. In R.A. Kowalski and K.A. Bowen, editors, Proceedings of the fifth International Conference and Symposium on Logic Programming, pages 481--495. The MIT Press, 1988.

....not need to know anything about the operational aspect of the program. All that they need to know about is the intended interpretation of the program. The quantity of queries may be large and reducing the quantity of queries has been the main objective of much research into declarative diagnosis [3, 4, 6, 16, 17]. The quantity of queries is dependent on the size of the search space and the search strategy [13, 19] In this paper we present a declarative diagnoser for normal programs. A normal program consists of a set of normal clauses of the form A L 1 ; Delta Delta Delta ; Lm 1 We use the term ....

....symptom of P w.r.t. I to be diagnosed. insufficiency=2 searches for an incompletely covered atom of P w.r.t. I in the set of all the selected atoms of all the nodes of an I cps for P [f Ag via a fixed computation rule R. The search space of the insufficiency diagnosis procedures presented in [4, 14, 16, 17] is the set of all the selected atoms of all the nodes of a SLDNF tree for P [ f Ag. Because an I cps for P [ f Ag is smaller than a SLDNF tree for P [f Ag, insufficiency=2 has a smaller search space than these insufficiency diagnosis procedures. The insufficiency diagnosis procedures presented ....

L.M. Pereira and M. Calejo. A Framework for Prolog Debugging. In R.A. Kowalski and K.A. Bowen, editors, Proceedings of the fifth International Conference and Symposium on Logic Programming, pages 481--495. The MIT Press, 1988.

....strategy [24, 6, 14, 19] Usually the search terminates when the first incorrectness is found, so changing the strategy can optimize the number of queries. Strategies better than the top down (or bottom up) are for example the divide and query strategy [24, 1] or some heuristics based strategies [22, 20]. Finally, we have considered positive answer formula as positive symptom, but we can use also another definition of positive symptom: 8(a cc 0 ) not valid in I such that 8(a c) is a sk positive answer. Then the algorithm is adapted and the notion of positive incorrectness founded is more ....

L. M. Pereira and M. Calejo. A Framework for Prolog Debugging. In R. A. Kowalski and K. A. Bowen, editors, Joint International Conference and Symposium on Logic Programming, pages 481--495. MIT Press, 1988.

.... the search terminates when the first incorrectness is found, so changing the strategy can optimize the number of queries to the oracle (the programmer) Strategies better than the top down (or bottom up) are for example the divide and query strategy [39, 5] or some heuristics based strategies [38, 35]. Another way to reduce the number of queries to the programmer is to store its previous answers, then it is no more invoked to answer to a query subsumed by a previous answer [39, 28, 7] A partial specification of the intended semantics can be given to the diagnoser in order to reduce again the ....

L. M. Pereira and M. Calejo. A Framework for Prolog Debugging. In International Conference and Symposium on Logic Programming, pages 481--495. MIT Press, 1988.

.... with little assistance to the novice on how to limit the search for a fix (Gegg Harrison, 1992) Various systems developed within the automated debugging community have some representation of how to go about finding program errors but very few have given the novice any control over this process (Pereira Calejo, 1988; Ducasse, 1992) Shapiro s algorithmic debugging system, for example, has a divide and query algorithm for locating the part of an execution within which an error must lie but the system makes no attempt to communicate this algorithm to the user (Shapiro, 1983) Just because these systems ....

Pereira, L.M. and Calejo, M. (1988). A framework for Prolog debugging. In Kowalski, R.A. and Bowen, K.A., (eds.), Fifth International Conference on Logic Programming, pages 481--495. Cambridge MA: MIT Press.

....subgoal are missing. The insufficiency diagnoser has to be called for this subgoal. If all the answers are NO then procedure p has to be corrected. This is similar to a suggestion of (Huntbach 1987) with a modification that non failing subgoals also have to be examined) and to the approach of (Pereira and Calejo 1988). A similar procedure is performed by a programmer in the examples of (Takahashi and Shibayama 1985) The difference is that in our approach the user is guided towards a declaratively correct program. A construction red cut incorrect clause is accepted by a debugger only after an explicit ....

....not require the user to provide correct subgoal instances. This also results in extending the allowed inputs for the diagnoser: the input is a goal whose computation terminates and delivers an incomplete set of computed answers. A different debugging approach is presented in Pereira (1986) and Pereira and Calejo (1988). That approach is not declarative but operational. It does not refer to an intended model but to the intended behaviour of the program. A program is understood through its operational properties and not through the logical ones. In addition to incorrectness and insufficiency, a third kind of ....

[Article contains additional citation context not shown here]

Pereira, L. M. and Calejo, M., A Framework for Prolog Debugging, Proceedings of the fifth International Conference and Symposium on Logic Programming - Seattle, 1988: 481:495.

....one rule defined for it, we need only add these rules for every pair of atoms a(X) and :a(X) that figure (both) as conclusions of rules in the program. 4 This notion can be seen as a special case of the notion of Suspect Sets, both of wrong and missing solutions, in declarative debugging [9, 3] 5 An alternative definition of support sets [4] relies on a notion of derivation for a literal in the WFS, and doesn t require the previous availability of the WF Model. 6 The complement literal of an atom A is A; that of a literal of the form A is A. 7 Note that there is a close ....

L. M. Pereira and M. Calejo. A framework for Prolog debugging. In K. B. R. Kowalski, editor, ICLP'88. MIT Press, 1988.

....there exist several SS(L) each contains one support of each default complement of the chosen literals. d) If :A 2 WFSX p (P ) there are, additionally, supports SS(L) SS k ( A) for each k: 9 This notion is a special case of the notion of Suspect Sets introduced in declarative debugging in [12] Example 11. Consider program P of example 8, whose paraconsistent well founded consequences are: WFSX p (P ) fnot s; r; not q; p; not :p; not b; a; not a; p; not pg: The supports of p are computed as follows: from the only rule for p we conclude that the supports of p are the supports of ....

L. M. Pereira and M. Calejo. A framework for Prolog debugging. In R. Kowalski, editor, 5th Int. Conf. on Logic Programming. MIT Press, 1988.

....body literals plus the literals in some SS of each body literal. ffl If L = A: If there are no rules defined for A in P then the only SS of L is fLg. 4 This notion can be seen as a special case of the notion of Suspect Sets, both of wrong and missing solutions, in declarative debugging [PC88, PCA90]. 5 An alternative definition of support sets [PAA90] relies on a notion of derivation for a literal in the WFS, and doesn t require the previous availability of the WF Model. Otherwise, choose from each rule defined for A, a literal such that its complement 6 belongs to M P . A SS(L) has ....

L. M. Pereira and M. Calejo. A framework for Prolog debugging. In K. B. R. Kowalski, editor, ICLP'88. MIT Press, 1988.

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