Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference42 articles.
1. Apt, K. R. (2003). Principles of constraint programming. Cambridge: Cambridge University Press.
2. Bacchus, F., & Stergiou, K. (2007). Solution directed backjumping for QCSP. In Proceedings 13th international conference on the principles and practice of constraint programming (CP 2007) (pp. 148–163).
3. Bacchus, F., & Walsh, T. (2004). A constraint algebra. Technical Report APES-77-2004, APES Research Group. http://www.dcs.st-and.ac.uk/~apes/apesreports.html .
4. Balafoutis, T., & Stergiou, K. (2006). Algorithms for stochastic CSPs. In Proceedings 12th international conference on the principles and practice of constraint programming (CP 2006) (pp. 44–58).
5. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling. Norwell: Kluwer Academic.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving quantified constraint satisfaction problems with value selection rules;Frontiers of Computer Science;2020-03-16
2. The Cut Tool for QCSP;2014 IEEE 26th International Conference on Tools with Artificial Intelligence;2014-11
3. Integrating Standard Dependency Schemes in QCSP Solvers;Journal of Computer Science and Technology;2012-01
4. Beyond QCSP for Solving Control Problems;Principles and Practice of Constraint Programming – CP 2011;2011
5. Constraint programming approach to a bilevel scheduling problem;Constraints;2010-08-28