Answer sets and nonmonotonic S4

Pearce, David

doi:10.1007/3-540-58025-5_60

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The study of such relations even allows to present a new characterization of answer sets. This characterization generalizes results by Pearce in [10], where he only considers the class of disjunctive programs.…”

Section: Introductionsupporting

confidence: 76%

Answer Set Programming and S4

Osorio

Navarro

2004

Advances in Artificial Intelligence – IBERAMIA 2004

View full text Add to dashboard Cite

We present a proposal on how to develop nonmonotonic reasoning based on the modal logic S4. As a consequence of our results we show how to present the well known semantics of answer sets, under a restricted fragment of modal formulas, using this approach. Moreover, by considering the full set of modal formulas we obtain an interesting generalization of answer sets with modal connectives. We show, with several examples, possible applications of this proposed inference system and how the syntax of modal formulas can clearly describe notions such as negation as failure. It is also possible to replace the modal logic S4 with any other modal logic to obtain similar nonmonotonic systems. We even consider the use of multimodal logics in order to model a scenario where several agents can reason about the knowledge and beliefs of each other. Our results clearly state interesting links between answer set programming, modal logics and multi-agent systems which might bring research of these areas together.

show abstract