References

  1. S. Abdennadher & H. Schütz (1998): CHR: A Flexible Query Language. In: Proceedings of the 3rd International Conference on Flexible Query Answering Systems, pp. 1–14, doi:10.1007/BFb0055987.
  2. C. Ansotegui, C. Gomes & B. Selman (2005): Achilles' Heel of QBF. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI'05), pp. 275–281.
  3. V. Barichard & I. Stéphan (2014): Theıt cut tool for QCSP. In: Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'14), pp. 883–890, doi:10.1109/ICTAI.2014.135.
  4. M. Benedetti, A. Lallouet & J. Vautard (2007): QCSP made Practical by virtue of Restricted Quantification. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 38–43.
  5. C. Bessiere & G. Verger (2006): Strategic constraint satisfaction problems. In: Proceedings of the Workshop on Modelling and Reformulation.
  6. H. Betz & T.W. Frühwirth (2013): Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. ACM Transactions on Computational Logic 14(1), doi:10.1145/2422085.2422086.
  7. L. Bordeaux & E. Monfroy (2002): Beyond NP: Arc-Consistency for Quantified Constraints. In: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP'02), pp. 371–386, doi:10.1007/3-540-46135-3_25.
  8. M. Cadoli, A. Giovanardi & M. Schaerf (1998): An Algorithm to Evaluate Quantified Boolean Formulae. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI'98), pp. 262–267.
  9. T.W. Frühwirth (1992): Constraint Handling Rules. Technical Report. ECRC.
  10. T.W. Frühwirth (1994): Constraint Handling Rules. In: Constraint Programming: Basics and Trends, pp. 90–107, doi:10.1007/3-540-59155-9_6.
  11. T.W. Frühwirth (2009): Constraint Handling Rules. Cambridge University Press, doi:10.1017/CBO9780511609886.
  12. T.W. Frühwirth & S. Abdennadher (2003): Essentials of Constraint Programming. Springer-Verlag, doi:10.1007/978-3-662-05138-2.
  13. T.W. Frühwirth & F. Raiser (2011): Constraint Handling Rules: Compilation, Execution, and Analysis.
  14. T.W. Frühwirth (1998): Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37(1-3), pp. 95–138, doi:10.1016/S0743-1066(98)10005-5.
  15. I.P Gent, P. Nightingale, A. Rowley & K. Stergiou (2008): Solving quantified constraint satisfaction problems. Artificial Intelligence 172(6-7), pp. 738–771, doi:10.1016/j.artint.2007.11.003.
  16. J.-Y. Girard (1987): Linear Logic. Theoretical Computer Science 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  17. P. Van Hentenryck (1991): Constraint logic programming. Knowledge Engineering Review 6(3), pp. 151–194, doi:10.1017/S0269888900005798.
  18. J. Jaffar & J.-L. Lassez (1987): Constraint Logic Programming. In: Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages, pp. 111–119, doi:10.1145/41625.41635.
  19. J. Jaffar & M.J. Maher (1994): Constraint Logic Programming: A Survey. Journal of Logic Programming 19/20, pp. 503–581, doi:10.1016/0743-1066(94)90033-7.
  20. N. Mamoulis & K. Stergiou (2004): Algorithms for Quantified Constraint Satisfaction Problems. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP'04), pp. 752–756, doi:10.1007/978-3-540-30201-8_60.
  21. P. Nightingale (2007): Consistency and the quantified constraint satisfaction problem. University of St. Andrews. Available at https://research-repository.st-andrews.ac.uk/handle/10023/759.
  22. C. Pralet & G. Verfaillie (2011): Beyond QCSP for Solving Control Problems. In: Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11), pp. 744–758, doi:10.1007/978-3-642-23786-7_56.
  23. M. Rabe & L. Tentrup (2015): CAQE: A Certifying QBF Solver. In: Formal Methods in Computer-Aided Design (FMCAD'15), pp. 136–143.
  24. T. Schrijvers & D.S. Warren (2004): Constraint Handling Rules and Tabled Execution. In: Proceedings of the 20th International Conference on Logic Programming (ICLP'04), pp. 120–136, doi:10.1007/978-3-540-27775-0_9.
  25. I. Stéphan (2018): A New Proof-theoretical Linear Semantics for CHR. In: Proceedings of the 34nd International Conference on Logic Programming (ICLP'18), Technical communication 64, pp. 4:1–4:18, doi:10.4230/OASIcs.ICLP.2018.4.
  26. G. Verger & C. Bessiere (2006): BlockSolve: a Bottom-Up Approach for Solving Quantified CSPs. In: Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP'06), pp. 635–649, doi:10.1007/11889205_45.
  27. G. Verger & C. Bessiere (2008): Guiding Search in QCSP^\voidb@x + with Back-Propagation. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP'08), pp. 175–189, doi:10.1007/978-3-540-85958-1_12.
  28. L. Zhang (2006): Solving QBF with Combined Conjunctive and Disjunctive Normal Form. In: Proceedings of the 21th National Conference on Artificial Intelligence (AAAI'06).
  29. L. Zhang & S. Malik (2002): Conflict Driven Learning in a Quantified Boolean Satisfiability Solver. In: Proceedings of the International Conference on Computer Aided Design (ICCAD'02), pp. 442–449, doi:10.1145/774572.774637.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org