BEE

swMATH16989MaRDI QIDQ28852

No author found.

Described by source

• Compiling finite domain constraints to SAT withBEE

Related Items (7)

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Optimal-depth sorting networks ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ What is answer set programming to propositional satisfiability ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings ⋮ Constraints for symmetry breaking in graph representation ⋮ meSAT: multiple encodings of CSP to SAT

This page was built for software: BEE