Computing stable models by using the ATMS

Authors:
Kave Eshghi
Affiliations:
Hewlett Packard Laboratories, Stoke Gifford, Bristol, England
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 5
Cited 0

An assumption-based TMS

Artificial Intelligence
A theory of diagnosis from first principles

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
Relating the TMS to autoepistemic logic

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
On the relation between truth maintenance and autoepistemic logic

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 auto-epistemic theories and ATMS structures.