Tabled evaluation with delaying for general logic programs Export

@article{citeulike:2551421, abstract = {SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages in stack-based memory management, SLDNF is often not appropriate for query evaluation for three reasons: a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same...}, author = {Chen, Weidong and Warren, David S.}, citeulike-article-id = {2551421}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9312}, journal = {Journal of the ACM}, keywords = {backward-chaining, datalog, logic-programming}, number = {1}, pages = {20--74}, posted-at = {2008-03-18 14:38:37}, priority = {2}, title = {Tabled evaluation with delaying for general logic programs}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9312}, volume = {43}, year = {1996} }

TY - JOUR ID - citeulike:2551421 L3 - citeulike-article-id:2551421 N2 - SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages in stack-based memory management, SLDNF is often not appropriate for query evaluation for three reasons: a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same... IS - 1 JF - Journal of the ACM EP - 74 TI - Tabled evaluation with delaying for general logic programs VL - 43 SP - 20 KW - backward-chaining KW - datalog KW - logic-programming AU - Chen, Weidong AU - Warren, David PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9312 ER -