Nonmonotonic Reasoning with Well Founded Semantics

Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the Well Founded model may be accepted to be a de nite view of the world and the extended stable models as alternative enlarged consistent belief models an agent may have about the world. Our purpose is to exhibit a modular systematic method of representing nonmonotonic problems with the Well Founded semantics of logic programs. In this paper we use this method to represent and solve some classical nonmonotonic problems. This leads us to consider our method quite generic.

• Type: Conference
• Year: 1991
• Where: ICLP
• Authors: Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes
• Keywords: Automated Reasoning, Classical Nonmonotonic Problems, ICLP 1991, Nonmonotonic Problems, Nonmonotonic Reasoning