On relation between constraint answer set programming and satisfiability modulo theories (Q4593096)
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: On relation between constraint answer set programming and satisfiability modulo theories |
scientific article; zbMATH DE number 6804640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On relation between constraint answer set programming and satisfiability modulo theories |
scientific article; zbMATH DE number 6804640 |
Statements
On relation between constraint answer set programming and satisfiability modulo theories (English)
0 references
9 November 2017
0 references
constraint answer set programming
0 references
constraint satisfaction processing
0 references
satisfiability modulo theories
0 references
0.6836473941802979
0 references
0.6709523797035217
0 references
0.6661990880966187
0 references
0.6623165607452393
0 references
