Relating the TMS to autoepistemic logic

Authors:
Yasushi Fujiwara;Shinichi Honiden
Affiliations:
Systems & Software Engineering Laboratory, TOSHIBA Corporation, Kawasaki, Japan;Systems & Software Engineering Laboratory, TOSHIBA Corporation, Kawasaki, Japan
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Year:
1989

Citing 9
Cited 1

An assumption-based TMS

Artificial Intelligence
Extending the ATMS

Artificial Intelligence
On the relation between default and autoepistemic logic

Artificial Intelligence
Negation in logic programming

Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs

Foundations of deductive databases and logic programming
Nonmonotonic Logic II: Nonmonotonic Modal Theories

Journal of the ACM (JACM)
On Logical Foundations of the ATMS

ECAI '90 Workshop on Truth Maintenance Systems
Semantical considerations on nonmonotonic logic

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1

Computing stable models by using the ATMS

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Truth maintenance systems have been studied by many authors and have become powerful tools in AI reasoning systems. From the viewpoint of commonsense reasoning, Doyle's TMS seems most interesting, for it allows nonmonotonic justifications. Its semantics, however, has remained unclear. In this paper, we shall give its declarative description in terms of autoepistemic logic, a kind of nonmonotonic logic. That is, we shall exhibit a one-to-one correspondence between states acceptable to the TMS and stable expansions of autoepistemic formulas attached to justifications. Thus, the TMS turns out to be a theorem prover of autoepistemic logic. For the practical interest, our result also suggests the possibility of implementing better TMS algorithms by using the theorem proving method of autoepistemic logic.