Computing loops with at most one external support rule (Q2946687)
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 6483191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing loops with at most one external support rule |
scientific article; zbMATH DE number 6483191 |
Statements
Computing Loops with at Most One External Support Rule (English)
0 references
17 September 2015
0 references
answer set semantics
0 references
answer set solvers
0 references
disjunctive logic programs
0 references
loop formulas
0 references
normal logic programs
0 references
well-founded semantics
0 references
0.9367724657058716
0 references
0.8098825216293335
0 references
0.8048756122589111
0 references
0.7936276793479919
0 references
0.7676190733909607
0 references
