BEE

MaRDI QIDQ28852swMATHFDO

Official website http://amit.metodi.me/research/bee/

Described by source

• Compiling finite domain constraints to SAT with BEE

Cited in

(12)

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

This page was built for software: BEE