An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Integrating answer set programming and constraint logic programming
Annals of Mathematics and Artificial Intelligence
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Formalization of psychological knowledge in answer set programming and its application
Theory and Practice of Logic Programming
Towards an integration of answer set and constraint solving
ICLP'05 Proceedings of the 21st international conference on Logic Programming
| Hi-index | 0.00 |
Answer Set Programming (ASP) combines a powerful, theoretically principled knowledge representation formalism and powerful solvers. To improve efficiency of computation on certain classes of problems, researchers have recently developed hybrid languages and solvers, combining ASP with language constructs and solving techniques from Constraint Programming (CP). The resulting ASP+CP solvers exhibit remarkable performance on "toy" problems. To the best of our knowledge, however, no hybrid ASP+CP language and solver have been used in practical, industrial-size applications. In this paper, we report on the first such successful application, consisting of the use of the hybrid ASP+CP system ezcsp to solve sophisticated industrial-size scheduling problems.