Author:
Nguyen Van-Hau,Son Mai Thai
Reference62 articles.
1. MiniZinc Challenge 2013 Results. https://www.minizinc.org/challenge2013/results2013.html.
2. The International SAT Competitions. http://www.satcompetition.org/.
3. F. A. Aloul. Symmetry in Boolean Satisfiability.Symmetry, 2(2): 1121--1134, 2010.
4. F. A. Aloul, K. A. Sakallah, and I. L. Markov. Efficient Symmetry Breaking for Boolean Satisfiability. InIJCAI, pages 271--276, 2003.
5. T. Alsinet, R. Béjar, A. Cabiscol, C. Fernández, and F. Manyà. Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. InTopics in Artificial Intelligence, 5th Catalonian Conference on AI (CCIA), volume 2504 ofLecture Notes in Computer Science, pages 139--144, 2002.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SAT Encodings of Finite-CSP Domains;Proceedings of the Eighth International Symposium on Information and Communication Technology;2017-12-07
2. Constraint-directed search for all-interval series;Constraints;2016-12-15
3. A New Method to Encode the At-Most-One Constraint into SAT;Proceedings of the Sixth International Symposium on Information and Communication Technology;2015-12-03