Showing 2000 · cs.AIShow all
3 papers · 2 filters
cs.AI2000
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…
cs.AI2000
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…
cs.AI2000
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…