Philippe Jégou

发表

Solution counting for CSP and SAT with large tree-width

Simon de Givry, Aurélie Favier, Philippe Jégou, 2011 .

A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances

Philippe Jégou, Lionel Paris, 2009, SARA.

Recherche arborescente bornée pour la résolution de CSP valués

Philippe Jégou, Cyril Terrioux, 2003 .

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

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2015, AAAI.

Two new constraint propagation algorithms requiring small space complexity

Philippe Jégou, Assef Chmeiss, Philippe Jégou, 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

On some partial line graphs of a hypergraph and the associated matroid

Philippe Jégou, Marie-Catherine Vilarem, 1993, Discret. Math..

Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report

Philippe Jégou, Djamal Habet, 2010, Abstraction, Reformulation, and Approximation.

On the Consistency of General Constraint-Satisfaction Problems

Philippe Jégou, Philippe Jégou, 1993, AAAI.

Hybrid backtracking bounded by tree-decomposition of constraint networks

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2003, Artif. Intell..

Combined Strategies for Decomposition-Based Methods for Solving CSPs

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

On the notion of cycles in hypergraphs

Philippe Jégou, Samba Ndiaye, 2009, Discret. Math..

Proving graph un-colorability with a consistency check of CSP

Philippe Jégou, Jean-Nicolas Bès, 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

A New Filtering Based on Decomposition of Constraint Sub-Networks

Philippe Jégou, Cyril Terrioux, 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

A Generalization of Chordal Graphs and the Maximum Clique Problem

Philippe Jégou, Assef Chmeiss, 1997, Inf. Process. Lett..

Tree-Decompositions with Connected Clusters for Solving Constraint Networks

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2014, CP.

A hybrid tractable class for non-binary CSPs

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

Proceedings of the Seventh International Workshop on Preferences and Soft Constraints

Carmel Domshlak, Martin C. Cooper, Simon de Givry, 2005 .

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

Philippe Jégou, Cyril Terrioux, Karim Boutaleb, 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs

Philippe Jégou, Cyril Terrioux, Helene Kanso, 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency

Philippe Jégou, 1990, ECAI.

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

Philippe Jégou, Bruno Zanuttini, Achref El Mouelhi, 2013, CPAIOR.

Combining Restarts, Nogoods and Decompositions for Solving CSPs

Philippe Jégou, Cyril Terrioux, 2014, ECAI.

Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size

Philippe Jégou, Cyril Terrioux, Hanan Kanso, 2016, CP.

Hidden Tractable Classes: From Theory to Practice

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

Using OBDDs to Handle Dynamic Constraints

Fabrice Bouquet, Philippe Jégou, F. Bouquet, 1997, Inf. Process. Lett..

Decomposition and Good Recording for Solving Max-CSPs

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2004, ECAI.

Improving Exact Solution Counting for Decomposition Methods

Philippe Jégou, Cyril Terrioux, Hanan Kanso, 2016, 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI).

Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2007, IJCAI.

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

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

Efficient Constraint Propagation With Good Space Complexity

Philippe Jégou, Assef Chmeiss, Philippe Jégou, 1996, CP.

Path-Consistency: When Space Misses Time

Philippe Jégou, Assef Chmeiss, Philippe Jégou, 1996, AAAI/IAAI, Vol. 1.

Hidden Tractable Classes

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2014 .

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2005, CP.

An Algorithmic Framework for Decomposing Constraint Networks

Philippe Jégou, Cyril Terrioux, Hanan Kanso, 2015, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI).

On the Relevance of Optimal Tree Decompositions for Constraint Networks

Philippe Jégou, Cyril Terrioux, Hélène Kanso, 2018, 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI).

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

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2006, CP.

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

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2017, Constraints.

A time-space trade-off for constraint networks decomposition

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

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

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

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

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2014, ISAIM.

Microstructures for CSPs with Constraints of Arbitrary Arity

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2013, SARA.

Solving Over-Constrained CSPs Using Weighted OBDDs

Fabrice Bouquet, Philippe Jégou, 1995, Over-Constrained Systems.

Davis and Putnam were Already Checking Forward

Philippe Jégou, Richard Génisson, Philippe Jégou, 1996, ECAI.

A Microstructure-Based Family of Tractable Classes for CSPs

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

On a generalization of triangulated graphs for domains decomposition of CSPs

Philippe Jégou, Assef Chmeiss, Lamia Keddar, 2003, IJCAI.

Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems

Philippe Jégou, 1993, AAAI.

Bounded Backtracking for the Valued Constraint Satisfaction Problems

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2003, CP.

A Hybrid Tractable Class for Non-binary CSPs

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2013, ICTAI.

Structural Consistency: A New Filtering Approach for Constraint Networks

Philippe Jégou, Cyril Terrioux, 2013, GKR.

On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems

Philippe Jégou, Bruno Zanuttini, Achref El Mouelhi, 2012, ISAIM.

Different Classes of Graphs to Represent Microstructures for CSPs

Philippe Jégou, Achref El Mouelhi, Cyril Terrioux, 2013, GKR.

Efficient Path-Consistency Propagation

Philippe Jégou, Assef Chmeiss, 1998, Int. J. Artif. Intell. Tools.

On the relations between SAT and CSP enumerative algorithms

Philippe Jégou, Richard Génisson, Philippe Jégou, 2000, Discret. Appl. Math..

Weather Routing Optimization: A New Shortest Path Algorithm

Philippe Jégou, Nicolas Prcovic, Estelle Chauveau, 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation

Philippe Jégou, Marie-Catherine Vilarem, P. Janssen, 1989, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence.

Dynamic Management of Heuristics for Solving Structured CSPs

Philippe Jégou, Samba Ndiaye, Cyril Terrioux, 2007, CP.

Exploiting Problem Structure for Solution Counting

Simon de Givry, Aurélie Favier, Philippe Jégou, 2009, CP.

Dynamic Heuristics for Branch and Bound on Tree‐Decomposition of Weighted CSPs

Philippe Jégou, Cyril Terrioux, Samba Ndojh Ndiaye, 2010 .

Strategies and heuristics for exploiting tree-decompositions of constraint networks

Philippe Jégou, Cyril Terrioux, Samba Ndojh Ndiaye, 2006 .

Synthia: Assisted Design of Peptide Synthesis Plans

Philippe Jégou, P. Janssen, B. Nouguier, 1991 .

Computing and exploiting tree-decompositions for ( Max-) CSP

Philippe Jégou, Cyril Terrioux, C. Terrioux, 2005 .