Publicaciones en las que colabora con CARLOS J. ANSOTEGUI GIL (13)

2013

  1. On the hardness of solving edge matching puzzles as SAT or CSP problems

    Constraints, Vol. 18, Núm. 1, pp. 7-37

2011

  1. Generating highly balanced sudoku problems as hard problems

    Journal of Heuristics, Vol. 17, Núm. 5, pp. 589-614

2010

  1. Solving Pseudo-Boolean modularity constraints

    Frontiers in Artificial Intelligence and Applications

2008

  1. Edge matching puzzles as hard SAT/CSP benchmarks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. From high girth graphs to hard instances

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Generating Hard SAT/CSP Instances Using Expander Graphs

    Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI 2008

  4. Generating hard SAT/CSP instances using expander graphs

    Proceedings of the National Conference on Artificial Intelligence

  5. Hard SAT and CSP instances with expander graphs

    10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008

  6. How hard is a commercial puzzle: The eternity II challenge

    Frontiers in Artificial Intelligence and Applications

2007

  1. On balanced CSPs with high treewidth

    Proceedings of the National Conference on Artificial Intelligence

2006

  1. The impact of balancing on problem hardness in a highly structured domain

    Proceedings of the National Conference on Artificial Intelligence

2004

  1. Modeling choices in quasigroup completion: SAT vs. CSP

    Proceedings of the National Conference on Artificial Intelligence

2003

  1. Automated monitoring of medical protocols: A secure and distributed architecture

    Artificial Intelligence in Medicine, Vol. 27, Núm. 3, pp. 367-392