## Abstract

In the paper we introduce a variant of autoepistemic logic that is especially suitable for expressing default reasonings. It is based on the notion of iterative expansion. We show a new way of translating default theories into the language of modal logic under which default extensions correspond exactly to iterative expansions. Iterative expansions have some attractive properties. They are more restrictive than autoepistemic expansions, and, for some classes of theories, than moderately grounded expansions. At the same time iterative expansions avoid several undesirable properties of strongly grounded expansions, for example, they are grounded in the whole set of the agent's initial assumptions and do not depend on their syntactic representation. Iterative expansions are defined syntactically. We define a semantics which leads to yet another notion of expansion - weak iterative expansion - and we show that there is an important class of theories, that we call ℐ-programs, for which iterative and weak iterative expansions coincide. Thus, for ℐ-programs, iterative expansions can be equivalently defined by semantic means.

Original language | English |
---|---|

Pages (from-to) | 275-302 |

Number of pages | 28 |

Journal | Annals of Mathematics and Artificial Intelligence |

Volume | 1 |

Issue number | 1-4 |

DOIs | |

State | Published - Sep 1990 |

## Keywords

- Autoepistemic logic
- default logic
- expansion
- iterative expansion
- logic of necessitation
- nonmonotonic reasoning

## ASJC Scopus subject areas

- Artificial Intelligence
- Applied Mathematics