B-Prolog is a high-performance implementation of the standard Prolog language with
several extensions including matching clauses, action rules for event handling, finite-domain …

Early resolution mechanisms proposed for tabling such as OLDT rely on suspension and
resumption of subgoals to compute fixpoints. Recently, a new resolution framework called …

This chapter is a survey of the history and the main concepts of Datalog. We begin with an
introduction to the language and its use for database definition and querying. We then look …

Tabling has emerged as an important evaluation technique in logic programming. Currently,
changes to a program (due to addition/deletion of rules/facts) after query evaluation …

Logic programming languages, such as Prolog, provide a high-level, declarative approach
to programming. Logic Programming offers great potential for implicit parallelism, thus …

Tabled logic programming (LP) systems have been applied to elegantly and quickly solving
very complex problems (eg, model checking). However, techniquescurren tly employed for …

Recently there has been a growing interest in research in tabling in the logic programming
community because of its usefulness in a variety of application domains including program …

In the dynamic programming paradigm the value of an optimal solution is recursively defined
in terms of optimal solutions to subproblems. Such dynamic programming definitions can be …

For any LP system, tabling can be quite handy in a variety of tasks, especially if it is
efficiently implemented and fully integrated in the language. Implementing tabling in Mercury …

Tabled evaluation has been proved an effective method to improve several aspects of goal-
oriented query evaluation, including termination and complexity. Several “native” …