References

  1. Nicolas Beldiceanu, Mats Carlsson & Jean-Xavier Rampon (2021): Global Constraint Catalog. http://sofdem.github.io/gccat/gccat/.
  2. Armin Biere, Marijn Heule, Hans van Maaren & Toby Walsh (2009): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 185. IOS Press.
  3. Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann & Torsten Schaub (2016): Answer Set Programming Modulo Acyclicity. Fundam. Informaticae 147(1), pp. 63–91, doi:10.3233/FI-2016-1398.
  4. Lucas Bordeaux, Youssef Hamadi & Lintao Zhang (2006): Propositional Satisfiability and Constraint Programming: A comparative survey. ACM Comput. Surv. 38(4), pp. 1–54. Available at http://doi.acm.org/10.1145/1177352.1177354.
  5. Gerhard Brewka, Thomas Eiter & Miroslaw Truszczyński (2011): Answer Set Programming at a Glance. Commun. ACM 54(12), pp. 92–103, doi:10.1017/S1471068407003250.
  6. Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf & Françoise Berthier (1988): The Constraint Logic Programming Language CHIP. In: FGCS, pp. 693–702.
  7. Sergii Dymchenko & Mariia Mykhailova (2015): Declaratively Solving Google Code Jam Problems with Picat. In: PADL, pp. 50–57, doi:10.1007/978-3-319-19686-2_4.
  8. Robert Fourer & David M. Gay (2002): Extending an Algebraic Modeling Language to Support Constraint Programming. INFORMS J. Comput. 14(4), pp. 322–344, doi:10.1287/ijoc.14.4.322.2825.
  9. Pascal Van Hentenryck (2002): Constraint and Integer Programming in OPL. INFORMS J. Comput. 14(4), pp. 345–372, doi:10.1287/ijoc.14.4.345.2826.
  10. Alexander Hertel, Philipp Hertel & Alasdair Urquhart (2007): Formalizing Dangerous SAT Encodings. In: SAT 4501, pp. 159–172, doi:10.1007/978-3-540-72788-0_18.
  11. Marijn J. H. Heule (2021): Chinese Remainder Encoding for Hamiltonian Cycles. In: SAT, pp. 216–224, doi:10.1007/978-3-030-80223-3_15.
  12. Jinbo Huang (2008): Universal Booleanization of Constraint Models. In: CP, pp. 144–158, doi:10.1007/978-3-540-85958-1_10.
  13. Peter Jeavons & Justyna Petke (2012): Local Consistency and SAT-Solvers. J. Artif. Intell. Res. 43, pp. 329–351, doi:10.1613/jair.3531.
  14. Andrew Johnson (2014): Quasi-linear reduction of Hamiltonian cycle problem (HCP) to satisfiability problem (SAT). Available at https://priorart.ip.com/IPCOM/000237123.
  15. Donald Knuth (2015): The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability. Addison-Wesley.
  16. Sharad Malik & Lintao Zhang (2009): Boolean satisfiability from theoretical hardness to practical success. Commun. ACM 52(8), pp. 76–82, doi:10.1145/1536616.1536637.
  17. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck & Guido Tack (2007): MiniZinc: Towards a Standard CP Modelling Language. In: CP, pp. 529–543, doi:10.1007/978-3-540-74970-7_38.
  18. Steven David Prestwich (2003): SAT problems with chains of dependent variables. Discret. Appl. Math. 130(2), pp. 329–350, doi:10.1016/S0166-218X(02)00410-9.
  19. Mirko Stojadinovic & Filip Maric (2014): meSAT: multiple encodings of CSP to SAT. Constraints An Int. J. 19(4), pp. 380–403, doi:10.1007/s10601-014-9165-7.
  20. Peter J. Stuckey, Kim Marriott & Guido Tack (2021): The MiniZinc Handbook. https://www.minizinc.org/doc-2.5.5/en/index.html.
  21. Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa & Mutsunori Banbara (2009): Compiling finite linear CSP into SAT. Constraints An Int. J. 14(2), pp. 254–272, doi:10.1007/s10601-008-9061-0.
  22. Miroslav N. Velev & Ping Gao (2009): Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles. In: SARA. AAAI. Available at http://www.aaai.org/ocs/index.php/SARA/SARA09/paper/view/837.
  23. Toby Walsh (2000): SAT v CSP. In: CP, pp. 441–456, doi:10.1007/3-540-45349-0_32.
  24. Neng-Fa Zhou (2020): In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem. In: CP, pp. 585–602, doi:10.1007/978-3-030-58475-7_34.
  25. Neng-Fa Zhou & Jonathan Fruhman (2017): Canonicalizing High-Level Constructs in Picat. In: PADL, pp. 19–33, doi:10.1007/978-3-319-51676-9_2.
  26. Neng-Fa Zhou & Håkan Kjellerstrand (2017): Optimizing SAT Encodings for Arithmetic Constraints. In: CP, pp. 671–686, doi:10.1007/978-3-319-66158-2_43.
  27. Neng-Fa Zhou, Håkan Kjellerstrand & Jonathan Fruhman (2015): Constraint Solving and Planning with Picat. Springer Briefs in Intelligent Systems. Springer, doi:10.1007/978-3-319-25883-6.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org