BEE

swMATH16989MaRDI QIDQ28852FDOQ28852

Author name not available (Why is that?)

Described by source

• Compiling finite domain constraints to SAT withBEE

Cited In (7)

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

This page was built for software: BEE