2 citations · 2 across the 6 of their papers we have counts for
6 papers
Embedding Description Logic Programs into Default Logic
Yisong Wang, Jia-Huai You, Li Yan Yuan +2
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\em et al.} have been considered as a prominent formalism for integrating rules and ont…
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…
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…
SLT-Resolution for the Well-Founded Semantics
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is…