On the satisfiability of circumscription (Q1073786): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:05, 5 March 2024

scientific article
Language Label Description Also known as
English
On the satisfiability of circumscription
scientific article

    Statements

    On the satisfiability of circumscription (English)
    0 references
    0 references
    1986
    0 references
    Es wird gezeigt: Wenn A erfüllbar ist und fast universal bezüglich P, so ist Circum(A;P) erfüllbar. Wenn A universal und erfüllbar ist, so ist Circum(A;P;Q) erfüllbar. Für disjunkte \(P^ 1,...,P^ k\), Q und jedes universale, erfüllbare A ist Circum(A,\(P^ 1>...>P^ k,Q)\) erfüllbar.
    0 references
    0 references

    Identifiers