Abstract
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 definite 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.
| Original language | English |
|---|---|
| Title of host publication | MIT Press |
| Publication status | Published - 1 Jan 1991 |
| Event | LOGIC PROGRAMMING : PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE - Duration: 1 Jan 1991 → … |
Conference
| Conference | LOGIC PROGRAMMING : PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE |
|---|---|
| Period | 1/01/91 → … |
Keywords
- Computer software
- Mathematical models
- Formal languages
- Formal logic