Computing Stable Models By Using the ATMS

Kave Eshghi

An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stable models of logic programs are closely connected to stable expansions of a class of autoepistemic theories, this algorithm points to a link between stable expansions of a class of autoepistemic theories and ATMS structures.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.