4 papers · 1 filter
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Y. D. Shen, Q. Yang, J. H. You +1
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s…
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…