Compiling finite domain constraints to SAT with<tt>BEE</tt> (Q4911128): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Compiling problem specifications into SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cardinality networks: a theoretical and empirical study / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compiling finite linear CSP into SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of diagnosis from first principles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Evaluating ASP and commercial solvers on the CSPLib / rank | |||
Normal rank |
Revision as of 07:18, 6 July 2024
scientific article; zbMATH DE number 6144682
Language | Label | Description | Also known as |
---|---|---|---|
English | Compiling finite domain constraints to SAT with<tt>BEE</tt> |
scientific article; zbMATH DE number 6144682 |
Statements
Compiling finite domain constraints to SAT with<tt>BEE</tt> (English)
0 references
13 March 2013
0 references
SAT encoding
0 references
FD constraints
0 references
equi-propagation
0 references
partial evaluation
0 references