Premium
On the relationship between CWA, minimal model, and minimal herbrand model semantics
Author(s) -
Gelfond Michael,
Przymusinska Halina,
Przymusinski Teodor
Publication year - 1990
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550050507
Subject(s) - semantics (computer science) , generalization , computer science , well founded semantics , formal semantics (linguistics) , class (philosophy) , existentialism , circumscription , theoretical computer science , minimal models , stable model semantics , operational semantics , artificial intelligence , programming language , mathematics , denotational semantics , epistemology , pure mathematics , philosophy , mathematical analysis
The purpose of this article is to compare three types of nonmonotonic semantics: (a) proof‐theoretic semantics based on the closed world assumption, (b) model‐theoretic semantics based on the notion of a minimal model, and (c) model‐theoretic semantics based on the notion of a minimal Herbrand model. All of these semantics capture the nonmonotonicity of commonsense reasoning, that is, the ability to withdraw conclusions after some new information is added to the original theories, and proved to be powerful enough to handle most examples of such reasoning presented in the literature. However, since these formalizations are based on different intuitions and often produce different results, the problem of understanding the relationship between them is especially important. In the first part of the article we concentrate on the class of positive logic programs , also called definite theories. Although the three semantics usually differ for universal sentences, our main result shows that they always coincide for existential queries. This result is particularly significant in view of the fact that in many applications existential queries are of main interest. It also plays an important role in the problem of finding a suitable declarative semantics for logic programs. In the second part we investigate arbitrary universal theories and we show that subtle differences exist between the three approaches and therefore no straightforward generalization of the results from the first part can be obtained.