J. Y. Liu, L., Adams, and W. Chen, Constructive negation under the well-founded semantics, Journal of Logic Programming 38(3):295-330 (1999). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
SLT-Resolution for the Well-Founded Semantics - Shen, Yuan, You (Correct)
....leaves 2 f l . These leaves respectively represent successful, failed, temporarily) undefined, and floundering derivations (see Definition 9 3. 5) In this paper, we shall not discuss floundering Gamma a situation where a non ground negative literal is selected by a computation rule R (see [5, 10, 14, 19] for discussion on such topic) Therefore, in the sequel we assume that no SLT trees contain flounder leaves. The construction of SLT trees can be viewed as that of SLDNF trees [8, 15] enhanced with the following loop handling mechanisms: 1) Loops are detected using ancestor lists of subgoals. ....
J. Y. Liu, L., Adams, and W. Chen, Constructive negation under the well-founded semantics, Journal of Logic Programming 38(3):295-330 (1999).
Tabling for Logic-based Artificial Intelligence - Swift (1999) (Correct)
.... used as a means to aggregate solutions for annotation logics [74] 75] 89] 115] 41] 35] or preference logics [58] 29] 4 Overview ffl A (very partial ) bibliography Formulations of Tabling: 48] 19] 122] 46] 71] 112] 128] 132] 23] 40] 81] 123] 24] 21] 32] [82], 53] 64] 134] 16] 13] 17] 18] 119] 110] 120] 136] Clear progress from Definite LPs, through Stratified and Normal LPs to Abductive LPs, Disjunctive LPs, and Quantitative LPs. Implementation and Systems [8] 129] 79] 49] 67] 98] 121] 109] 39] 9] 22] ....
J. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, SMU, 1996.
A New Formulation of Tabled Resolution with Delay - Swift (1999) (Correct)
.... [3] Linear resolution with Selection function for General logic programs) is of interest because it can be used with non ground programs and because it has formed the foundation of extended implementation efforts (such as the XSB system [7] Extensions to SLG address constructive negation [10], and a property called delay minimality [16] Understood in their proper context, the ideas that differentiate SLG from other tabling methods are relatively simple. SLG breaks down tabled evaluation into a set of primitive operations (or, equivalently transformations) To handle possible loops ....
J. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, SMU, 1996.
A General Tabulation Procedure for Extended Constraint Logic.. - Damásio, Pereira (Correct)
....and positive recursions. The integration of constraint technology in tabulation procedures is not new, see for instance [6] However, the systems present in the literature only take care of positive recursions, i.e. recur sions which do not involve default negated literals, or are incomplete [15]. The novelty of our procedure is the simultaneous treatment of positive and negative recursions, together with general constraint handling features used to implement constructive negation, enabling us to address in this way the floundering problem in its full generality. For lack of space we ....
....to tabulation techniques. The reader can find below an outline of the solution presented in [8] Tabulation is nowadays well understood for the case of definite logic programming. Recently, some extensions of tabulation methods for the case of normal logic programs have appeared in the literature [5, 3, 15]. Both [5, 3] provide a sound and complete query evaluation procedure for non floundering normal logic programs under wellfounded semantics. The procedures in [15] include an incremental constructive negation schema but it is only defined for finite terminating normal logic programs, and is not ....
[Article contains additional citation context not shown here]
J. Y. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, Computer Science and Engineering, Southern Methodist University, 1997. Accepted for publication.
A New Formulation of Tabled Resolution with Delay Draft - Terrance Swift (Correct)
.... [2] Linear resolution with Selection function for General logic programs) is of interest because it can be used with non ground programs and because it has formed the foundation of extended implementation efforts (such as the XSB system [6] Extensions to SLG address constructive negation [10], and a property called delay minimality [16] Understood in their proper context, the ideas that differentiate SLG from other tabling methods are relatively simple. SLG breaks down tabled evaluation into a set of primitive operations (or, equivalently transformations) To handle possible loops ....
J. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, SMU, 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