On multiple learning schemata in conflict driven solvers

CEUR Workshop Proceedings

Volumn 1231, Issue , 2014, Pages 133-146

  Formisano, Andrea ^a   Vella, Flavio ^b  

^a UNIVERSITY OF PERUGIA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY;

CONFLICT ANALYSIS; DIRECTED ACYCLIC GRAPH (DAG); GENERAL LEARNING; GLOBAL OBJECTIVE FUNCTIONS; GLOBAL OPTIMALITY; SAT SOLVERS; SEARCH STRATEGIES; STANDARD ALGORITHMS;

OPTIMIZATION;

EID: 84908498353     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. A. Arbelaez and P. Codognet. A GPU implementation of parallel constraint-based local search. In PDP, pages 648-655. IEEE, 2014.
2. C. Bentz. On the hardness of finding near-optimal multicuts in directed acyclic graphs. Theor. Comput. Sci., 412(39):5325-5332, 2011.
3. A. Berry, J.-P. Bordat, and O. Cogis. Generating all the minimal separators of a graph. In Graph-Theoretic Concepts in Computer Science, pages 167-172. Springer, 1999.
4. A. Biere. Handbook of satisfiability, Vol. 185. Ios PressInc, 2009.
5. F. Campeotto, A. Dal Palù, A. Dovier, F. Fioretto, and E. Pontelli. Exploring the use of GPUs in constraint solving. In M. Flatt and H.-F. Guo, eds., PADL, Vol. 8324 of LNCS, pages 152-167. Springer, 2014.
6. C. S. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein. Experimental study of minimum cut algorithms. In Proc. of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 324-333. Society for Industrial and Applied Mathematics, 1997.
7. M.-C. Costa, L. Létocart, and F. Roupin. Minimal multicut and maximal integer multiflow: a survey. European Journal of Operational Research, 162(1):55-69, 2005.
8. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiway cuts. In Proc. of the 24th ACM Symposium on Theory of Computing, pages 241-251. ACM, 1992.
9. A. Dal Palù, A. Dovier, A. Formisano, and E. Pontelli. Exploiting unexploited computing resources for computational logics. In Proc. of the CILC-12, Vol. 857 of CEUR Workshop Proceedings, pages 74-88. CEUR-WS.org, 2012.
10. A. Dal Palù, A. Dovier, A. Formisano, and E. Pontelli. CUD@SAT: SAT solving on GPUs. Journal of Experimental and Theoretical Artificial Intelligence, 2014.
11. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Commun. ACM, 5(7):394-397, 1962.
12. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi) cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
13. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Answer set solving in practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(3):1-238, 2012.
14. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. of the ACM, 35(4):921-940, 1988.
15. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. Discrete Applied Mathematics, 155(12):1549-1561, 2007.
16. J. Hao and J. B. Orlin. A faster algorithm for finding the minimum cut in a graph. In Proc. of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 165-174. Society for Industrial and Applied Mathematics, 1992.
17. H. Jin and F. Somenzi. Strong conflict analysis for propositional satisfiability. In G.G.E. Gielen, ed., Proc. of the DATE 2006, pages 818-823. European Design and Automation Association, Leuven, Belgium, 2006.
18. S. Kratsch, M. Pilipczuk, M. Pilipczuk, and M. Wahlström. Fixed-parameter tractability of multicut in directed acyclic graphs. In A. Czumaj, K. Mehlhorn, A. M. Pitts, and R. Watten-hofer, eds., Proc. of ICALP, Vol. 7391 of LNCS, pages 581-593. Springer, 2012.
19. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. of the ACM, 46(6):787-832, 1999.
20. P. Manolios and Y. Zhang. Implementing survey propagation on graphics processing units. In A. Biere and C. P. Gomes, eds., SAT, Vol. 4121 of LNCS, pages 311-324. Springer, 2006.
21. R. Marques, L. G. Silva, P. F. Flores, and L. M. Silveira. Improving SAT solver efficiency using a multi-core approach. In C. Boonthum-Denecke and G. M. Youngblood, eds., FLAIRS Conference. AAAI Press, 2013.
22. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
23. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM, 53(6):937-977, 2006.
24. J.-C. Picard and M. Queyranne. On the structure of all minimum cuts in a network and applications. In V. Rayward-Smith, ed., Combinatorial Optimization II, Vol. 13 of Mathematical Programming Studies, pages 8-16. Springer, 1980.
25. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4):777-788, 1983.
26. F. Rossi, P. Van Beek, and T. Walsh. Handbook of constraint programming. Elsevier, 2006.
27. L. Ryan. Efficient algorithms for clause-learning SAT solvers. Simon Fraser University, 2004. Master thesis in computer science.
28. H. Shen, K. Li, and S.-Q. Zheng. Separators are as simple as cutsets. In P. S. Thiagarajan and R. H. C. Yap, eds., Proc. of Advances in Computing Science - ASIAN'99, Vol. 1742 of LNCS, pages 347-358. Springer, 1999.
29. H. Shen and W. Liang. Efficient enumeration of all minimal separators in a graph. Theor. Comput. Sci., 180(1-2):169-180, 1997.
30. K. Takata. Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph. Discrete Applied Mathematics, 158(15):1660-1667, 2010.
31. V. V. Vazirani and M. Yannakakis. Suboptimal cuts: Their enumeration, weight and number. In Automata, Languages and Programming, pages 366-377. Springer, 1992.
32. F. Vella, A. Dal Palù, A. Dovier, A. Formisano, and E. Pontelli. CUD@ASP: Experimenting with GPGPUs in ASP solving. In Proc. of the CILC-12, Vol. 1068 of CEUR Workshop Proceedings, pages 163-177. CEUR-WS.org, 2013.
33. L.-P. Yeh, B.-F. Wang, and H.-H. Su. Efficient algorithms for the problems of enumerating cuts by non-decreasing weights. Algorithmica, 56(3):297-312, 2010.
34. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in Boolean satisfiability solver. In ICCAD, pages 279-285, 2001.