Author:
de Oliveira Ricardo Tavares,Silva Fabiano
Publisher
Springer International Publishing
Reference14 articles.
1. Oliveira, R.T.D., Silva, F.: Sat and maxsat encodings for trees applied to the steiner tree problem. In: 2014 Brazilian Conference on Intelligent Systems (BRACIS), pp. 192–197, October 2014
2. Prestwich, S.: Sat problems with chains of dependent variables. Disc. Appl. Math. 130(2), 329–350 (2003)
3. Bryant, R.E., Velev, M.N.: Boolean satisfiability with transitivity constraints. ACM Trans. Comput. Logic 3(4), 604–627 (2002)
4. Velev, M.N., Gao, P.: Design of parallel portfolios for sat-based solving of hamiltonian cycle problems. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM 2010), Fort Lauderdale, Florida, USA, January 6–8, 2010 (2010)
5. The IBM Research Symposia Series;R Karp,1972
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 24. Maximum Satisfiabiliy;Frontiers in Artificial Intelligence and Applications;2021-02-02