Circumscription: Completeness reviewed (Q685339): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4692931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of non-monotonic reasoning / 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
Property / cites work
 
Property / cites work: A generalization of collapsible cases of circumscription / rank
 
Normal rank

Revision as of 10:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Circumscription: Completeness reviewed
scientific article

    Statements

    Circumscription: Completeness reviewed (English)
    0 references
    0 references
    17 October 1993
    0 references
    The author gives a counterexample to the minimality result of \textit{D. Perlis} and \textit{J. Minker} [Completeness results for circumscription, Artif. Intell. 28, 29-42 (1986; Zbl 0589.03021)] but shows that the result still holds if it is restricted to well-founded theories in the sense that every nonminimal model contains a minimal model and if the notion of circumscription is strengthened. He also investigates the relationship between minimality and reducibility of model theories in circumscription.
    0 references
    0 references
    minimality
    0 references
    reducibility
    0 references
    circumscription
    0 references