The power of non-ground rules in Answer Set Programming (Q4593042)
From MaRDI portal
!
WARNING
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 6804597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The power of non-ground rules in Answer Set Programming |
scientific article; zbMATH DE number 6804597 |
Statements
The power of non-ground rules in Answer Set Programming (English)
0 references
9 November 2017
0 references
answer set programming
0 references
rewriting
0 references
non-ground rules
0 references
rule decomposition
0 references
0 references
0.9262456
0 references
0.8972981
0 references
0.8953344
0 references
0.8953344
0 references
0.89430726
0 references
0.8772745
0 references
0.87648195
0 references
