Achref El Mouelhi

Orcid: 0000-0003-4880-8941

According to our database1, Achref El Mouelhi authored at least 16 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Variable Elimination in Binary CSPs (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Variable Elimination in Binary CSPs.
J. Artif. Intell. Res., 2019

2018
On a new extension of BTP for binary CSPs.
Constraints An Int. J., 2018

2017
Tractable classes for CSPs of arbitrary arity: from theory to practice.
Constraints An Int. J., 2017

A BTP-Based Family of Variable Elimination Rules for Binary CSPs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

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

On Broken Triangles.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Constraint Decomposition Based on Tractable Properties.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Extending Broken Triangles and Enhanced Value-Merging.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
A hybrid tractable class for non-binary CSPs.
Constraints An Int. J., 2015

On the Decomposition of Non-binary Constraint into Equivalent Binary Constraints.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

2014
Hidden Tractable Classes: From Theory to Practice.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Microstructures for CSPs with Constraints of Arbitrary Arity.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Different Classes of Graphs to Represent Microstructures for CSPs.
Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2013

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.
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.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012


  Loading...