ML Anthology

Computing Stable Models by Using the ATMS

Kave Eshghi
AAAI 1990 pp. 272-277
/aaai/1990/eshghi1990aaai-computing/

Abstract

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

PDF AAAI Semantic Scholar

Cite

Text

Eshghi. "Computing Stable Models by Using the ATMS." AAAI Conference on Artificial Intelligence, 1990.

Markdown

[Eshghi. "Computing Stable Models by Using the ATMS." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/eshghi1990aaai-computing/)

BibTeX

@inproceedings{eshghi1990aaai-computing,
  title     = {{Computing Stable Models by Using the ATMS}},
  author    = {Eshghi, Kave},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1990},
  pages     = {272-277},
  url       = {https://mlanthology.org/aaai/1990/eshghi1990aaai-computing/}
}