Computing stable models by using the ATMS
Kave Eshghi · 1990
An algorithm is described which computes stable mod-els of propositional logic programs with negation as fail-ure using the Assumption Based Truth Maintenance mechanism. Since stable models of logic programs are closely connected to stable expansions of a class of auto-epistemic theories, this algorithm points to a link be-tween stable expansions of a class of autoepistemic the-ories and ATMS structures