The complexity of predicate default logic over a countable domain (Q1861328): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of predicate default logic over a countable domain |
scientific article |
Statements
The complexity of predicate default logic over a countable domain (English)
0 references
16 March 2003
0 references
default logic
0 references
circumscription
0 references
computability theoretic complexity
0 references
