Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. Lecture Notes in Computer Science, 1753:109--123, 2000. 7  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to explore whether a hybrid of SLGWAM 98 and CHAT might provide performance superior to both. And nally, the goal of YapTab was to provide an engine with good sequential performance that could be t into the environment copying Or parallel engine of YAP. Recently so called Linear Tabling Methods [19, 13, 7] have been proposed and implemented. These methods do not suspend computations, but restore the necessary earlier states by recomputing them. This recomputation causes them to have worse complexity than SLG on some programs. Since these are not implementations of the SLG architecture, they are not ....

Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. In Proceedings of PADL 2000, pages 109-123, 2000.

....concentrate on a CHAT implementation of tabling, and refer the interested reader to the above references for differences between these abstract machines. Note that recently a different form of a tabling mechanism, named linear tabling, has emerged which does not require suspension resumption [ZSYY00] As a result, heap management in a linear tabling system is like in a plain Prolog system. Linear tabling is currently implemented in B Prolog. Independently of the implementation model that is chosen for the suspension resumption mechanism, tabling calls for sophisticated memory management. ....

Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. In Enrico Pontelli and V'itor Santos Costa, editors, Practical Aspects of Declarative Languages: Second International Workshop, number 1753 in LNCS, pages 109--123. Springer, January 2000. 55

....external space, as is done in CAT [5] the same principle was used to suspend orparallel work in Muse [1] The CHAT model [6] signi cantly reduces the overheads of copying and is currently the default scheme in XSB Prolog. In more recent work some authors have proposed a linear tabling mechanism [20] and a reordering based tabling mechanism [9] Both of these schemes avoid freezing by recomputing goals until a xed point is reached. 3 Tabling and Parallelism In previous work [12] we proposed two computational models to combine tabling with or parallelism, the OPT and the TOP approaches. We ....

Neng-Fa Zhou. Implementation of a Linear Tabling Mechanism. In Proceedings of PADL'2000, number 1753 in LNCS, pages 109-123. Springer-Verlag, January 2000.

....erased. To later resume a suspended branch, the bindings belonging to the branch must be restored. SLG WAM achieves this by using an extension of the standard trail, the forward trail, to keep track of the bindings values. Other implementation mechanisms for tabling have been proposed recently [6, 5, 9, 16]. 3 Tabling and Parallelism In previous work [11] we proposed two computational models to combine tabling with or parallelism, the OPT and the TOP approaches. We have decided to implement the OPT approach [12] The OPT approach generalizes Warren s multisequential engine framework for ....

Neng-Fa Zhou. Implementation of a Linear Tabling Mechanism. In Proceedings of PADL'2000, number 1753 in LNCS, pages 109-123. Springer-Verlag, January 2000.

No context found.

Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, and Jia-Huai You. Implementation of a linear tabling mechanism. Lecture Notes in Computer Science, 1753:109--123, 2000. 7

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