Linear Tabulated Resolution Based on Prolog Control Strategy

Theory and Practice of Logic Programming (Impact Factor: 0.29). 04/2000; DOI: 10.1017/S1471068400001010
Source: CiteSeer

ABSTRACT Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG-resolution, and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabul...

  • [Show abstract] [Hide abstract]
    ABSTRACT: ABox abduction is an important reasoning facility in Description Logics DLs. It finds all minimal sets of ABox axioms, called abductive solutions, which should be added to a background ontology to enforce entailment of an observation which is a specified set of ABox axioms. However, ABox abduction is far from practical by now because there lack feasible methods working in finite time for expressive DLs. To pave a way to practical ABox abduction, this paper proposes a new problem for ABox abduction and a new method for computing abductive solutions accordingly. The proposed problem guarantees finite number of abductive solutions. The proposed method works in finite time for a very expressive DL,, which underpins the W3C standard language OWL 2, and guarantees soundness and conditional completeness of computed results. Experimental results on benchmark ontologies show that the method is feasible and can scale to large ABoxes.
    International journal on Semantic Web and information systems 04/2012; 8(2):1-33. · 0.25 Impact Factor
  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Summary Tabling is a technique that can get rid of innite loops and redundant computations in the execution of recursive logic programs. The main idea of tabling is to memorize the answers to subgoals and use the answers to resolve their variant descendents. Tabling helps narrow the gap between declarative and procedural readings of logic programs. It not only is useful in the problem domains that motivated its birth, such as program analysis, parsing, deductive database, and theorem proving, but also has been found essential in several other problem domains such as model checking, learning, and data mining. Early resolution mechanisms proposed for tabling such as OLDT rely on suspension and resumption of subgoals to compute xp oints. Recently, a new resolution framework called linear tabling, envisioned by the proposer and several other researchers, has received considerable attention because of its simplicity, ease of implementation, and good space eciency . The idea of linear tabling is to use depth-rst iterative deepening rather than suspension to compute xp oints. Linear tabling is still immature compared with OLDT and a great of potential remains to be exploited. The objective of this project is to qualitatively and quantitatively analyze possible strategies and propose eectiv e optimization techniques to make it sustainable to large applications such as natural language and data mining

Full-text (2 Sources)

Available from
May 31, 2014