A theorem on the consistency of circumscription (Q578934): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Saturation, nonmonotonic reasoning and the closed-world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the satisfiability of circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for circumscription / rank
 
Normal rank

Latest revision as of 10:01, 18 June 2024

scientific article
Language Label Description Also known as
English
A theorem on the consistency of circumscription
scientific article

    Statements

    A theorem on the consistency of circumscription (English)
    0 references
    0 references
    1987
    0 references
    This paper gives more general conditions under which McCarthy's circumscription is consistent, allowing application of the method outside the domain of universal sentences. It is shown that circumscription as presented here continues to correspond to the semantic model of minimization. Some applications are detailed.
    0 references
    commonsense reasoning in predicate logic
    0 references
    nonmonotonic logic
    0 references
    circumscription
    0 references
    semantic model of minimization
    0 references

    Identifiers