Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols (Q4608717)
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 6852231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols |
scientific article; zbMATH DE number 6852231 |
Statements
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols (English)
0 references
22 March 2018
0 references
answer set programming
0 references
bottom-up evaluation
0 references
computational complexity
0 references
function symbols
0 references
program termination
0 references
stable models
0 references
0.8945306
0 references
0.88400745
0 references
0.88109183
0 references
0.88088703
0 references
0.8778988
0 references
0.8769438
0 references
0.8763017
0 references
0.87189156
0 references
