Cyril Terrioux

According to our database, Cyril Terrioux authored at least 54 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Computing partial hypergraphs of bounded width.

Nabil Adrar, Philippe Jégou, Cyril Terrioux

Discret. Appl. Math., April, 2023

A CP Approach for the Liner Shipping Network Design Problem.

Yousra El Ghazi, Djamal Habet, Cyril Terrioux

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022

BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming.

Adrien Varet, Nicolas Prcovic, Cyril Terrioux, Denis Hagebaum-Reignier, Yannick Carissan

J. Chem. Inf. Model., 2022

How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids.

Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet

Constraints An Int. J., 2022

2021

Conflict history based heuristic for constraint satisfaction problem solving.

Djamal Habet, Cyril Terrioux

J. Heuristics, 2021

Combining VSIDS and CHB Using Restarts in SAT.

Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Exhaustive Generation of Benzenoid Structures Sharing Common Patterns.

Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

Variable Elimination in Binary CSPs (Extended Abstract).

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the Refinement of Conflict History Search Through Multi-Armed Bandit.

Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux

Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry.

Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet

Proceedings of the Principles and Practice of Constraint Programming, 2020

Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming.

Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

Variable Elimination in Binary CSPs.

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux

J. Artif. Intell. Res., 2019

Conflict history based search for constraint satisfaction problem.

Djamal Habet, Cyril Terrioux

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

2018

On the Relevance of Optimal Tree Decompositions for Constraint Networks.

Philippe Jégou, Hélène Kanso, Cyril Terrioux

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Conflict History Based Branching Heuristic for CSP Solving.

Djamal Habet, Cyril Terrioux

Proceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications co-located with 30th International Conference on Artificial Intelligence Tools (ICTAI 2018), 2018

2017

Combining restarts, nogoods and bag-connected decompositions for solving CSPs.

Philippe Jégou, Cyril Terrioux

Constraints An Int. J., 2017

Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs.

Philippe Jégou, Helene Kanso, Cyril Terrioux

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.

Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini

Artif. Intell., 2016

On Broken Triangles.

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Improving Exact Solution Counting for Decomposition Methods.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2016

Extending Broken Triangles and Enhanced Value-Merging.

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2016

Classes polynomiales du problème CSP : entre théorie et pratique.

Cyril Terrioux

, 2016

2015

A hybrid tractable class for non-binary CSPs.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Constraints An Int. J., 2015

An Algorithmic Framework for Decomposing Constraint Networks.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

A Microstructure-Based Family of Tractable Classes for CSPs.

Martin C. Cooper, Philippe Jégou, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2015

The Extendable-Triple Property: A New CSP Tractable Class beyond BTP.

Philippe Jégou, Cyril Terrioux

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Bag-Connected Tree-Width: A New Parameter for Graph Decomposition.

Philippe Jégou, Cyril Terrioux

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Hidden Tractable Classes: From Theory to Practice.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Combining Restarts, Nogoods and Decompositions for Solving CSPs.

Philippe Jégou, Cyril Terrioux

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Tree-Decompositions with Connected Clusters for Solving Constraint Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Microstructures for CSPs with Constraints of Arbitrary Arity.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Different Classes of Graphs to Represent Microstructures for CSPs.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2013

Structural Consistency: A New Filtering Approach for Constraint Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2013

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2010

A New Filtering Based on Decomposition of Constraint Sub-Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009

A Generalized Cyclic-Clustering Approach for Solving Structured CSPs.

Cédric Pinto, Cyril Terrioux

Proceedings of the ICTAI 2009, 2009

Combined Strategies for Decomposition-Based Methods for Solving CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the ICTAI 2009, 2009

A Tree Decomposition Based Approach to Solve Structured SAT Instances.

Djamal Habet, Lionel Paris, Cyril Terrioux

Proceedings of the ICTAI 2009, 2009

2008

A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving.

Cédric Pinto, Cyril Terrioux

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.

Samba Ndiaye, Philippe Jégou, Cyril Terrioux

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007

Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the IJCAI 2007, 2007

Dynamic Management of Heuristics for Solving Structured CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

(No)good Recording and ROBDDs for Solving Structured (V)CSPs.

Karim Boutaleb, Philippe Jégou, Cyril Terrioux

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

A Time-Space Trade-Off for Constraint Networks Decomposition.

Philippe Jégou, Cyril Terrioux

Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Decomposition and Good Recording for Solving Max-CSPs.

Philippe Jégou, Cyril Terrioux

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003

Hybrid backtracking bounded by tree-decomposition of constraint networks.

Philippe Jégou, Cyril Terrioux

Artif. Intell., 2003

Bounded Backtracking for the Valued Constraint Satisfaction Problems.

Cyril Terrioux, Philippe Jégou

Proceedings of the Principles and Practice of Constraint Programming, 2003

2001

Recherche coopérative et Nogood Recording.

Cyril Terrioux

Proceedings of the Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril, 2001

Cooperative Search and Nogood Recording.

Cyril Terrioux

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001