Daniel Le Berre and Stephanie Roussel.
Sat4j: on the fly solver configuration, System Description.
In Journal on Satisfiability, Boolean Modeling and Computation (JSAT),
2013.
To appear
Youssef Hamadi, Saïd Jabbour and Lakhdar Saïs.
Learning from Conflicts in Propositional Satisfiability.
In A Quarterly Journal of Operations Research (4OR),
10(1),
pages 15-32,
2012.
Martin Cooper and Stanislav Živný.
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation.
In Journal of Artificial Intelligence Research,
44,
pages 455-490,
2012.
David A. Cohen, Martin Cooper, Paidi Creed, Dániel Marx and András Z. Salamon.
The Tractability of CSP Classes Defined by Forbidden Patterns.
In Journal of Artificial Intelligence Research,
45,
pages 47-78,
2012.
International Conference
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux and Bruno Zanuttini.
Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms.
In Proceedings of the 10th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR),
May 2013.
To appear
Victor Lagerkvist, Gustav Nordh, Peter Jonsson and Bruno Zanuttini.
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.
In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA),
2013.
David A. Cohen, Martin Cooper, Guillaume Escamocher and Stanislav Živný.
Variable Elimination in Binary CSP via Forbidden Patterns.
In Proceedings IJCAI'13,
2013.
To appear
Said Jabbour, Jerry Lonlac and Lakhdar Sais.
Intensification Search in Modern SAT Solvers.
In 15th International Conference on Theory and Applications of Satisfiability Testing (SAT 2012),
7317,
pages 491 - 492,
LNCS,
2013.
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux and Bruno Zanuttini.
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
In International Symposium on Artificial Intelligence and Mathematics (ISAIM),
January 2012.
Martin Cooper, Frédéric Maris and Pierre Régnier.
Tractable Monotone Temporal Planning.
In Proceedings of 22nd International Conference on Automated Planning and Scheduling (ICAPS-2012),
June 2012.
Saïd Jabbour, Jerry Lonlac and Lakhdar Saïs.
Extending Resolution by Dynamic Substitution of Boolean Functions.
In IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012),
pages 1029-1034,
November 2012.
Martin Cooper, Guillaume Escamocher and Stanislav Živný.
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.
In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP-2012),
pages 265-273,
2012.
David A. Cohen, Martin Cooper, Martin J. Green and Dániel Marx.
On Guaranteeing Polynomially Bounded Search Tree Size.
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011),
pages 160-171,
2011.
Martin Cooper and Stanislav Živný.
Hierarchically nested convex VCSP.
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011),
pages 187-194,
2011.
Martin Cooper and Stanislav Živný.
Tractable triangles.
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011),
pages 195-209,
2011.
National Conference
Saïd Jabbour, Jerry Lonlac and Lakhdar Saïs.
Résolution Etendue par Substitution Dynamique des Fonctions Booléennes.
In Actes des 8eme Journées Francophones de Programmation par Contraintes (JFPC'2012),
pages 146-155,
May 2012.
(in french)
Saïd Jabbour, Jerry Lonlac and Lakhdar Saïs.
Intensification de la Recherche dans les Solveurs SAT Modernes.
In Actes des 8eme Journées Francophones de Programmation par Contraintes (JFPC'2012),
pages 146-155,
May 2012.
(in french)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux and Bruno Zanuttini.
Sur la complexité des algorithmes de backtracking et quelques nouvelles classes polynomiales pour CSP.
In Actes des 8ème Journées Francophones de Programmation par Contraintes (JFPC 2012),
pages 160-169,
2012.
(in french)
