Funder
Australian Research Council
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference73 articles.
1. Abío, I., Stuckey, P.J.: Conflict directed lazy decomposition. In: Milano, M. (ed.) Principles and Practice of Constraint Programming: Proceedings of the 18th International Conference, Lecture Notes in Computer Science, vol. 7514, pp. 70–85. Springer (2012)
2. Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 5015, pp. 6–20. Springer (2008)
3. Amadini, R., Gabbrielli, M., Mauro, J.: An empirical evaluation of portfolios approaches for solving CSPs. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Proceedings of the 10th International Conference, Lecture Notes in Computer Science, pp. 316–324. Springer (2013)
4. Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY: a lazy portfolio approach for constraint solving. Theory Pract. Log. Program. 14(4–5), 509–524 (2014)
5. Amadini, R., Gabbrielli, M., Mauro, J.: A multicore tool for constraint solving. In: Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI’15), pp. 232–238. AAAI Press (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A SAT Enhanced Word-Level Solver for Constrained Random Simulation;2023 International Symposium of Electronics Design Automation (ISEDA);2023-05-08
2. Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases;Theory and Applications of Satisfiability Testing – SAT 2020;2020
3. Learning to Optimize the Alloy Analyzer;2019 12th IEEE Conference on Software Testing, Validation and Verification (ICST);2019-04