The complexity of predicate default logic over a countable domain (Q1861328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1882254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of predicate default logic over a countable domain |
scientific article; zbMATH DE number 1882254 |
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
0.7774168848991394
0 references
0.7757757902145386
0 references
