Solving constraint satisfaction problems with SAT modulo theories (Q487632): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6389798 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constraint programming | |||
Property / zbMATH Keywords: constraint programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reformulation | |||
Property / zbMATH Keywords: reformulation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
solvers and tools | |||
Property / zbMATH Keywords: solvers and tools / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
satisfiability modulo theories | |||
Property / zbMATH Keywords: satisfiability modulo theories / rank | |||
Normal rank |
Revision as of 20:55, 30 June 2023
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