Constructive Tightly Grounded Autoepistemic Reasoning

Abstract

The key concept of autoepistemic logic introduced by Moore is a stable expansion of a set of premises, i.e., a set of beliefs adopted by an agent with perfect introspection capabilities on the basis of the premises. Moore's formalization of a stable expansion, however, is nonconstructive and produces sets of beliefs which are quite weakly grounded in the premises. A new more constructive definition of the sets of beliefs of the agent is proposed. It is based on classical logic and enumerations of formulae. Considering only a certain subclass of enumerations, L-hierarchic enumerations, an attractive class of expansions is captured to characterize the sets of beliefs of a fully introspective agent. These L-hierarchic expansions are stable set minimal, very tightly grounded in the premises and independent of the syntactic representation of premises. Furthermore, Reiter's default logic is shown to be a special case of autoepistemic logic based on L-hierarchic expansions.

Cite

Text

Niemelä. "Constructive Tightly Grounded Autoepistemic Reasoning." International Joint Conference on Artificial Intelligence, 1991.

Markdown

[Niemelä. "Constructive Tightly Grounded Autoepistemic Reasoning." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/niemela1991ijcai-constructive/)

BibTeX

@inproceedings{niemela1991ijcai-constructive,
  title     = {{Constructive Tightly Grounded Autoepistemic Reasoning}},
  author    = {Niemelä, Ilkka},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1991},
  pages     = {399-405},
  url       = {https://mlanthology.org/ijcai/1991/niemela1991ijcai-constructive/}
}