Computing the extensions of autoepistemic and default logics with a truth maintenance system

Authors:
Ulrich Junker;Kurt Konolige
Affiliations:
GMD;Artificial Intelligence Center, SRI International, Menlo Park, California
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 9
Cited 1

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Formalizing nonmonotonic reasoning systems

Artificial Intelligence
On the relation between default and autoepistemic logic

Artificial Intelligence
Hard problems for simple default logics

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Decision Procedure for Autoepistemic Logic

Proceedings of the 9th International Conference on Automated Deduction
The ins and outs of reason maintenance

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
A correct non-monotonic ATMS

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
All i know: an abridged report

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2

On semantics of TMS

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we develop a proof procedure for autoepistemic (AEL) and default logics (DL), based on translating them into a Truth Maintenance System (TMS). The translation is decidable if the theory consists of a finite number of defaults and premises and classical derivability for the base language is decidable. To determine all extensions of a network, we develop variants of Doyle's labelling algorithms.