K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for fixed-order stratified programs. In Proc. of 13th Conference on Automated Deduction., pages 328--342, 1996. BIBLIOGRAPHY 172  Home/Search   Document Not in Database   Summary   Related Articles   Check

....as they are created. The Completion operation for the mixed strategy engine is described in Algorithm 7.3.2. Note that for negation handling, Integ CheckComplete will act according to the strategy of the leader: for batched SCCs it will use the procedures and data structures described in [SSW96b] for local SCCs, even though the mechanisms for delay and simplification are the same as for Batched Scheduling, a simpler implementation can be achieved (since there is no need to build SDGs, all manipulations required to maintain the necessary SDG structures are avoided) CHAPTER 7. ....

K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for fixed-order stratified programs. In Proc. of 13th Conference on Automated Deduction., pages 328--342, 1996.

.... For each subgoal S in the SCC of S If S has a consuming node with unresolved answers TmpSchedChain = Integ ScheduleAnswers(S ) 5 SchedChain = SchedChain [ TmpSchedChain; If S 6= S SchedStrat(S ) batched; Return SchedChain; SCCs it will use the procedures and data structures described in [SSW96b] for local SCCs, even though the mechanisms for delay and simplification are the same as for Batched Scheduling, a simpler implementation can be achieved (since there is no need to build SDGs, all manipulations required to maintain the necessary SDG structures are avoided) Algorithm 7.3.2 ....

K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for fixed-order stratified programs. In Proc. of 13th Conference on Automated Deduction., pages 328--342, 1996.

....sections provide a brief introduction to SLG resolution as it is implemented in XSB. For interested users, the ftp directory and web site contain papers covering in detail various aspects of tabling. An overview of SLG resolution, and a practical evaluation strategy for it are provided in [7, 28] [30, 29, 24, 15, 34, 26] describe fully the SLG WAM as it is implemented in Version 1.7.1, and [35, 6] analyze its performance. 5.1 SLG Evaluation 5.1.1 Tabling Consider the Prolog program ancestor(X,Y) parent(X,Y) ancestor(X,Y) ancestor(X,Z) parent(Z,Y) together with the query ancestor(1,Y) This ....

....Exceptions: The same as call 1 (see section 6.7) tnot( P) Tabling The semantics of tnot 1 allows for correct execution of programs with according to the wellfounded semantics. P must be a tabled predicate, For a detailed description of the actions of tabled negation for in XSB Version 1.7. 1 see [30, 29]. Chapter 5 contains further discussion of the functionality of tnot 1. Exceptions: instantiation error P is not ground (floundering occurs) type error P is not a callable term. table error P is not a call to a tabled predicate. t not ( P) Tabling Same as tnot 1 but does not check for ....

K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for fixed-order stratified programs. In Proc. of 13th Conference on Automated Deduction., pages 328--342, 1996. BIBLIOGRAPHY 172

....it. Tabling and Related Research Formulation [41] 17] 108] 38] 60] 98] 115] 120] 15] 14] 20] 22] 33] 19] 105] 34] 94] 54] 110] 23] 27] Implementation and Systems [6] 116] 64] 42] 2] 55] 82] 84] 106] 107] 93] 7] 21] 43] 44] [96], 121] 45] 83] 95] 92] Optimizations [30] 6 Motivation Magic Sets and Related Research (e.g. Alexander Method) Formulation [87] 5] 97] 111] 18] 69] 67] 8] 59] 73] 103] 39] 49] 79] 9] 101] 89] 66] Implementation and Systems [6] 24] 112] ....

K. Sagonas, T. Swift, and D.S. Warren. An abstract machine for fixed-order stratified programs. In Proc. of 13th Conference on Automated Deduction., 1996.

....Section 3.2) suffices to evaluate definite programs. A detailed description of the their implementation, along with their integration with the SLD resolution of Prolog, is given in [14] The addition to the SLG WAM of negation return, negation suspension and early completion has been described in [12] and this engine forms the basis of version 1.5 of XSB. Work continues to implement the SLG WAM for all normal programs, using delay and simplification transformations to break the fixed order search when the engine enters a flummoxed state. However the results in this section are potentially ....

K. Sagonas, T. Swift, and D. Warren. An abstract machine for fixed-order stratified programs. Technical report, SUNY at Stony Brook, 1995.

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