Representing constraint satisfaction problems in answer set programming (Q3089162)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Representing constraint satisfaction problems in answer set programming |
scientific article; zbMATH DE number 5942145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Representing constraint satisfaction problems in answer set programming |
scientific article; zbMATH DE number 5942145 |
Statements
24 August 2011
0 references
answer set programming (ASP)
0 references
specification language
0 references
constraint satisfaction problems
0 references
unified approach
0 references
global constraints
0 references
industrial-size applications
0 references
0.870816171169281
0 references
0.8656919598579407
0 references
0.8578717112541199
0 references
0.8494248390197754
0 references
0.8480461835861206
0 references
