On the satisfiability of circumscription (Q1073786): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Erica Melis / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Erica Melis / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0004-3702(86)90028-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076024411 / 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: Saturation, nonmonotonic reasoning and the closed-world assumption / rank | |||
Normal rank | |||
Latest revision as of 12:33, 17 June 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
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
