SLT-resolution for the well-founded semantics

DOI10.1023/A:1020116927466zbMath1003.68066OpenAlexW1589528070MaRDI QIDQ1598446

Yi-Dong Shen, Jia-Huai You, Li Yan Yuan

Publication date: 15 October 2002

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020116927466

zbMATH Keywords

procedural semanticsSLG-resolutionglobal SLS-resolutionlinear tabling

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (2)

Complexity results for answer set programming with bounded predicate arities and implications ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms

This page was built for publication: SLT-resolution for the well-founded semantics