47 citations · 47 across the 2 of their papers we have counts for
7 papers
Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms
Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan
Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the {\em linearity} p…
Recycling Computed Answers in Rewrite Systems for Abduction
Fangzhen Lin, Jia-Huai You
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanati…
Unfolding Partiality and Disjunctions in Stable Model Semantics
T. Janhunen, I. Niemela, D. Seipel +2
The paper studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementat…
A Dynamic Approach to Characterizing Termination of General Logic Programs
Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan +2
We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the…
Verifying Termination of General Logic Programs with Concrete Queries
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is esta…
Linear Tabulated Resolution Based on Prolog Control Strategy
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You +1
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 checki…