Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System

Abstract

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

Extracted Key Phrases

Statistics

0510'93'96'99'02'05'08'11'14'17
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Junker1990ComputingTE, title={Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System}, author={Ulrich Junker and Kurt Konolige}, booktitle={AAAI}, year={1990} }