Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains (Q5425403)
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 5211331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains |
scientific article; zbMATH DE number 5211331 |
Statements
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains (English)
0 references
13 November 2007
0 references
0.7561752796173096
0 references
0.7502850294113159
0 references
0.7485365867614746
0 references
0.7477204203605652
0 references
0.745985209941864
0 references
