Efficient SAT Techniques for Relative Encoding of Permutations with Constraints - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Miroslav N. Velev, Ping Gao 0002. Efficient SAT Techniques for Relative Encoding of Permutations with Constraints. In Ann E. Nicholson, Xiaodong Li, editors, AI 2009: Advances in Artificial Intelligence, 22nd Australasian Joint Conference, Melbourne, Australia, December 1-4, 2009. Proceedings. Volume 5866 of Lecture Notes in Computer Science, pages 517-527, Springer, 2009. [doi]

This author has not been identified. Look up 'Miroslav N. Velev' in GoogleThis author has not been identified. Look up 'Ping Gao 0002' in Google