Towards a Complete Scheme for Tabled Execution Based on Program Transformation

Guzmán, Pablo Chico de; Carro, Manuel; Hermenegildo, Manuel V.

doi:10.1007/978-3-540-92995-6_16

Cited by 5 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This provides confidence that an improved implementation (for example, tabling primitives are not yet compiled into WAM code and still have to traverse the Prolog-C interface as in [15]), the internal representation for MVB can be improved, and goal scheduling is still simplistic and does not try to favor our technique by decreasing the probability of cache misses) can make MVB a viable technique for tabling which does not need very complicated stack management and which can compete with state-of-the-art systems.…”

Section: Experimental Evaluationmentioning

confidence: 98%

See 1 more Smart Citation

A Tabling Implementation Based on Variables with Multiple Bindings

2009

Self Cite

View full text Add to dashboard Cite

Abstract. Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known implementation approaches for this purpose. Resuming a goal using this technique reinstalls the bindings for all the variables in the environment where the goal was suspended. In this paper we explore an alternative approach where variables can keep track of several bindings, associated with suspensions. Resuming a goal boils down to determining which suspension has to be resumed, in order to select, when dereferencing, the bindings which were active at the moment of suspending. We present the ideas behind this approach, highlight several advantages over other suspension-based implementations, and perform an experimental evaluation. We also recall the similarity between OR-parallelism and suspension-based implementations of tabling, and discuss similarities with the Version Vectors Method, among others.

show abstract

Section: Experimental Evaluationmentioning

confidence: 98%

“…Due to space limitations several details of the implementation of tabling based on suspension are not discussed. For a more complete description, the reader is referred to [9,11,15].…”

Section: Tabling and Variable Managementmentioning

confidence: 99%

A Tabling Implementation Based on Variables with Multiple Bindings

2009

Self Cite

View full text Add to dashboard Cite

show abstract

“…For the max mode, the algorithm then tries to update BE with ANS if it is greater than the current answer in BE. To do so, it repeats a CAS operation until it succeeds (lines [8][9][10][11][12] or until it finds a better (maximal) answer, a case where it simply returns such answer (lines 10-11).…”

Section: Algorithmsmentioning

confidence: 99%

“…Work on tabling proved its viability for application areas such as deductive databases, inductive logic programming, knowledge based systems, model checking, program analysis, and reasoning in the semantic web, among many others. Currently, the tabling technique is widely available in systems like B‐Prolog, Ciao Prolog, Mercury, Picat, XSB Prolog, and YAP Prolog . Mode‐directed tabling is an extension to the tabling technique that supports the definition of alternative criteria, or modes , for specifying how answers are inserted into the table space.…”

Section: Introductionmentioning

confidence: 99%

Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog

Areias

Rocha

2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary This work proposes a new design for the supporting data structures used to implement multithreaded tabling in Prolog systems. Tabling is an implementation technique that improves the expressiveness of traditional Prolog systems in dealing with recursion and redundant computations. Mode‐directed tabling is an extension to the tabling technique that supports the definition of alternative criteria for specifying how answers are aggregated, thus being very suitable for problems where the goal is to dynamically calculate optimal or selective answers. In this work, we leverage the intrinsic potential that mode‐directed tabling has to express dynamic programming problems by creating a new design that improves the representation of multi‐dimensional arrays in the context of multithreaded tabling. To do so, we introduce a new mode for indexing arguments in mode‐directed tabled evaluations, named dim, where each dim argument features a uni‐dimensional lock‐free array. Experimental results using well‐known dynamic programming problems on a 32‐core machine show that the new design introduces less overheads and clearly improves the execution time for sequential and multithreaded tabled evaluations.

show abstract

“…Several Prolog systems that initially did not support tabling are, nowadays, converging to support some kind of tabling mechanism. Implementations of tabling are currently available in systems such as B-Prolog [33], Ciao Prolog [34], Mercury [5], SWI-Prolog [8], XSB Prolog [32] and YAP Prolog [35]. For our test bench environment, it is then particularly important to support the evaluation of tabled programs.…”

Section: Logic Programming Prolog and Tablingmentioning

confidence: 99%

On the Implementation of a Cloud-Based Computing Test Bench Environment for Prolog Systems

2017

View full text Add to dashboard Cite

Software testing and benchmarking are key components of the software development process. Nowadays, a good practice in large software projects is the continuous integration (CI) software development technique. The key idea of CI is to let developers integrate their work as they produce it, instead of performing the integration at the end of each software module. In this paper, we extend a previous work on a benchmark suite for the YAP Prolog system, and we propose a fully automated test bench environment for Prolog systems, named Yet Another Prolog Test Bench Environment (YAPTBE), aimed to assist developers in the development and CI of Prolog systems. YAPTBE is based on a cloud computing architecture and relies on the Jenkins framework as well as a new Jenkins plugin to manage the underlying infrastructure. We present the key design and implementation aspects of YAPTBE and show its most important features, such as its graphical user interface (GUI) and the automated process that builds and runs Prolog systems and benchmarks.

show abstract

Towards a Complete Scheme for Tabled Execution Based on Program Transformation

Cited by 5 publications

References 22 publications

A Tabling Implementation Based on Variables with Multiple Bindings

A Tabling Implementation Based on Variables with Multiple Bindings

Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog

On the Implementation of a Cloud-Based Computing Test Bench Environment for Prolog Systems

Contact Info

Product

Resources

About