Solving constraint satisfaction problems with SAT modulo theories (Q487632): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57979695, #quickstatements; #temporary_batch_1710286847436 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10601-012-9123-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015135969 / rank | |||
Normal rank | |||
Revision as of 21:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving constraint satisfaction problems with SAT modulo theories |
scientific article |
Statements
Solving constraint satisfaction problems with SAT modulo theories (English)
0 references
22 January 2015
0 references
constraint programming
0 references
reformulation
0 references
solvers and tools
0 references
satisfiability modulo theories
0 references
