Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655)
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: Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories |
scientific article; zbMATH DE number 6389809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories |
scientific article; zbMATH DE number 6389809 |
Statements
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (English)
0 references
22 January 2015
0 references
weighted CSP
0 references
modelling languages
0 references
reformulation
0 references
meta-constraints
0 references
SMT
0 references
weighted maxsat
0 references
0 references
0.7439851760864258
0 references
0.7237675189971924
0 references
0.7179794311523438
0 references
0.7133200168609619
0 references
0.7118812203407288
0 references
