OLD resolution with tabulation

Tamaki, Hisao; Sato, Taisuke

doi:10.1007/3-540-16492-8_66

Cited by 265 publications

(165 citation statements)

References 2 publications

Supporting

Mentioning

165

Contrasting

Order By: Relevance

“…Thus, dynamic programming in general, and tabling [21,22] in particular, is expected to play an important role in effective problem solving when using competitive or-parallelism.…”

Section: The Role Of Tablingmentioning

confidence: 99%

High Level Thread-Based Competitive Or-Parallelism in Logtalk

Moura

Rocha

Madeira

2008

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. This paper presents the logic programming concept of threadbased competitive or-parallelism, which combines the original idea of competitive or-parallelism with committed-choice nondeterminism and speculative threading. In thread-based competitive or-parallelism, an explicit disjunction of subgoals is interpreted as a set of concurrent alternatives, each running in its own thread. The individual subgoals usually correspond to predicates implementing different procedures that, depending on the problem specifics, are expected to either fail or succeed with different performance levels. The subgoals compete for providing an answer and the first successful subgoal leads to the termination of the remaining ones. We discuss the implementation of thread-based competitive or-parallelism in the context of Logtalk, an object-oriented logic programming language, and present experimental results.

show abstract

“…Thus, dynamic programming in general, and tabling [21,22] in particular, is expected to play an important role in effective problem solving when using competitive or-parallelism.…”

Section: The Role Of Tablingmentioning

confidence: 99%

High Level Thread-Based Competitive Or-Parallelism in Logtalk

Moura

Rocha

Madeira

2008

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

show abstract

“…Tabling [1][2][3] is a strategy for executing logic programs which memoizes already processed calls and their answers to improve several of the limitations of the SLD resolution strategy. It guarantees termination for programs with the bounded term size property, improves efficiency in programs which repeatedly perform some computation, and has been successfully applied to deductive databases [4], program analysis [5,6], semantic Web reasoning [7], model checking [8], etc.…”

Section: Introductionmentioning

confidence: 99%

“…In turn, and in our current implementation, variable access is not constant-time any more. 3 Herein, we present and evaluate an implementation of this idea.…”

Section: Introductionmentioning

confidence: 99%

A Tabling Implementation Based on Variables with Multiple Bindings

2009

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

“…For first-order terms, subsumption is efficient and employed for guaranteeing termination in tabling (or memoization) approaches to backward chaining of logic [4,5]. However, when we move from first-order terms to Web queries subsumption (or containment) becomes quickly less efficient or even intractable.…”

Section: Introductionmentioning

confidence: 99%

Simulation Subsumption or Déjà vu on the Web

Bry¹,

Furche²,

Linse³

2008

Web Reasoning and Rule Systems

View full text Add to dashboard Cite

Abstract. Simulation unification is a special kind of unification adapted to retrieving semi-structured data on the Web. This article introduces simulation subsumption, or containment, that is, query subsumption under simulation unification. Simulation subsumption is crucial in general for query optimization, in particular for optimizing pattern-based search engines, and for the termination of recursive rule-based web languages such as the XML and RDF query language Xcerpt. This paper first motivates and formalizes simulation subsumption. Then, it establishes decidability of simulation subsumption for advanced query patterns featuring descendant constructs, regular expressions, negative subterms (or subterm exclusions), and multiple variable occurrences. Finally, we show that subsumption between two query terms can be decided in O(n! n ) where n is the sum of the sizes of both query terms.

show abstract

OLD resolution with tabulation

Cited by 265 publications

References 2 publications

High Level Thread-Based Competitive Or-Parallelism in Logtalk

High Level Thread-Based Competitive Or-Parallelism in Logtalk

A Tabling Implementation Based on Variables with Multiple Bindings

Simulation Subsumption or Déjà vu on the Web

Contact Info

Product

Resources

About