Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication. (Explanation-based algorithms in Constraint Programming)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Résolution de problèmes combinatoires par des approches fondées sur la notion d’explication Hadrien Cambazard

[1]  John N. Hooker,et al.  Optimization and , 2000 .

[2]  Cecilia Ekelin.  An Optimization Framework for Scheduling of Embedded Real-Time Systems , 2004 .

[3]  Krithi Ramamritham,et al.  Allocation and scheduling of complex periodic tasks , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[4]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[5]  Karem A. Sakallah,et al.  Conflict analysis in search algorithms for propositional satisfiability , 1996 .

[6]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[7]  John N. Hooker.  Duality in Optimization and Constraint Satisfaction , 2006, CPAIOR.

[8]  David G. Mitchell,et al.  A SAT Solver Primer , 2005, Bull. EATCS.

[9]  Paul Shaw,et al.  A Constraint for Bin Packing , 2004, CP.

[10]  Jerome Amilhastre.  Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes , 1999 .

[11]  Patrice Boizumault,et al.  Dynamic Backtracking with Constraint Propagation Application to static and dynamic CSPs , 1997 .

[12]  Narendra Jussien,et al.  The versatility of using explanations within constraint programming , 2003 .

[13]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[14]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[15]  Fahiem Bacchus,et al.  Unrestricted Nogood Recording in CSP Search , 2003, CP.

[16]  Guillaume Rochart.  Explications et programmation par contraintes avancée , 2005 .

[17]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[18]  Barry O'Sullivan,et al.  The Impact of Search Heuristics on Heavy-Tailed Behaviour , 2006, Constraints.

[19]  Christian Bessiere,et al.  Statistical Regimes Across Constrainedness Regions , 2004, Constraints.

[20]  Barbara M. Smith.  In Search of Exceptionally Difficult Constraint Satisfaction Problems , 1995, Constraint Processing, Selected Papers.

[21]  Hadrien Cambazard,et al.  Decomposition and Learning for a Hard Real Time Task Allocation Problem , 2004, CP.

[22]  Jean-François Puget,et al.  Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming , 2001, Interfaces.

[23]  José Carlos Becceneri,et al.  A method for solving the minimization of the maximum number of open stacks problem within a cutting process , 2004, Comput. Oper. Res..

[24]  William J. Cook,et al.  Parallel Mixed Integer Programming , 1995 .

[25]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.

[26]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[27]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[28]  Guillaume Rochart,et al.  Implementing explained global constraints , 2004 .

[29]  Pascal Richard,et al.  Allocating and scheduling tasks in multiple fieldbus real-time systems , 2003, EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696).

[30]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction a More Accurate Picture , 2022 .

[31]  Mark Wallace,et al.  Problem Decomposition for Traffic Diversions , 2004, CPAIOR.

[32]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[33]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

[34]  Hadrien Cambazard,et al.  Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming , 2005, CPAIOR.

[35]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[36]  Narendra Jussien,et al.  Vers une unification des algorithmes de résolution de CSP , 2002 .

[37]  Lucas Bordeaux,et al.  Propositional Satisfiability and Constraint Programming: A comparative survey , 2006, CSUR.

[38]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[39]  Anne-Marie Déplanche,et al.  A genetic algorithm for scheduling tasks in a real-time distributed system , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[40]  Cédric Pralet,et al.  Travelling in the World of Local Searches in the Space of Partial Assignments , 2004, CPAIOR.

[41]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[42]  Quanshi Xia,et al.  A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems , 2005, CPAIOR.

[43]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[44]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[45]  Jimmy Ho-Man Lee,et al.  Speeding Up Constraint Propagation By Redundant Modeling , 1996, CP.

[46]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[47]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[48]  Nageshwara Rao Vempaty.  Solving Constraint Satisfaction Problems Using Finite State Automata , 1992, AAAI.

[49]  Hans A. Hansson,et al.  The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks , 1998, Real-Time Systems.

[50]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[51]  Samba Ndiaye,et al.  Sur la génération et l'exploitation de décompositions pour la résolution de réseaux de contraintes , 2005 .

[52]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[53]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[54]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[55]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[56]  Mark E. Stickel,et al.  Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.

[57]  B. Earl Wells,et al.  Heuristic Model for Task Allocation in a Heterogeneous Distributed Computing System , 1996, PDPTA.

[58]  Luca Benini,et al.  Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs , 2006, CPAIOR.

[59]  Matt W. Mutka,et al.  A tool for allocating periodic real-time tasks to a set of processors , 1995, J. Syst. Softw..

[60]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[61]  E.-G. Talbi,et al.  Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[62]  Vasek Chvátal,et al.  Resolution Search , 1995, Discret. Appl. Math..

[63]  John Gaschnig,et al.  A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.

[64]  Jean-Daniel Fekete,et al.  VISEXP: Visualizing Constraint Solver Dynamics Using Explanations , 2004, FLAIRS.

[65]  Narendra Jussien,et al.  Relaxation de Contraintes pour les problèmes dynamiques , 1997 .

[66]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[67]  Christian Bliek,et al.  Generalizing Partial Order and Dynamic Backtracking , 1998, AAAI/IAAI.

[68]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[69]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[70]  Bruce W. Watson,et al.  Incremental construction of minimal acyclic finite state automata , 2000, CL.

[71]  Patrice Boizumault,et al.  k-relevant Explanations for Constraint Programming , 2003, FLAIRS.

[72]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[73]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[74]  Philippe Jégou,et al.  Un compromis temps-espace pour la résolution de réseaux de contraintes par décomposition , 2005 .

[75]  Patrick Prosser,et al.  MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .

[76]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[77]  Pascal Van Hentenryck,et al.  To Be or Not to Be ... a Global Constraint , 2003, CP.

[78]  Fahiem Bacchus,et al.  Generalized NoGoods in CSPs , 2005, AAAI.

[79]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[80]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[81]  Philippe Jégou,et al.  Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[82]  Barry O'Sullivan,et al.  Automata for Nogood Recording in Constraint Satisfaction Problems , 2006 .

[83]  Jean-Daniel Fekete,et al.  Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming , 2005, SoftVis '05.

[84]  Nicolas Beldiceanu,et al.  Global Constraint Catalog , 2005 .

[85]  Narendra Jussien,et al.  The PaLM system: explanation-based constraint programming , 2000 .

[86]  Hadrien Cambazard,et al.  Integrating Benders Decomposition Within Constraint Programming , 2005, CP.

[87]  Alan Burns,et al.  Allocating hard real-time tasks: An NP-Hard problem made easy , 1992, Real-Time Systems.

[88]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[89]  Peter J. Stuckey,et al.  Dynamic Programming to Minimize the Maximum Number of Open Stacks , 2007, INFORMS J. Comput..

[90]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[91]  Jörg Würtz,et al.  Scheduling of Time-Triggered Real-Time Systems , 2000, Constraints.

[92]  Krzysztof Kuchcinski,et al.  Partial task assignment of task graphs under heterogeneous resource constraints , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[93]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[94]  John J. H. Forrest,et al.  Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .

[95]  C. Ribeiro,et al.  A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints , 1995, Int. J. High Speed Comput..

[96]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

[97]  Thierry Benoist,et al.  Constraint Programming Contribution to Benders Decomposition: A Case Study , 2002, CP.

[98]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[99]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[100]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[101]  Peter van Beek,et al.  Conflict-Directed Backjumping Revisited , 2011, J. Artif. Intell. Res..

[102]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[103]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[104]  Mats Carlsson,et al.  A New Multi-resource cumulatives Constraint with Negative Heights , 2002, CP.

[105]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[106]  Krzysztof Kuchcinski,et al.  Digital Systems Design Using Constraint Logic Programming , 2000 .

[107]  Johan de Kleer,et al.  Problem Solving with the ATMS , 1986, Artif. Intell..

[108]  Pascal Van Hentenryck.  Constraint and Integer Programming in OPL , 2002, INFORMS J. Comput..

[109]  Andrea Lodi,et al.  Cutting Planes in Constraint Programming: A Hybrid Approach , 2000, CP.

[110]  Narendra Jussien,et al.  Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..

[111]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[112]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[113]  N. J.L.deSiqueira,et al.  Explanation-Based Generalisation of Failures , 1988, ECAI.

[114]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[115]  Gérard Ferrand,et al.  Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.

[116]  R.S. de Oliveira,et al.  Empirical study of tabu search, simulated annealing and multi-start in fieldbus scheduling , 2005, 2005 IEEE Conference on Emerging Technologies and Factory Automation.

[117]  Pierre-Emmanuel Hladik.  Ordonnançabilité et placement des systèmes temps réel distribués, préemptifs et à priorités fixes , 2004 .

[118]  Björn Lisper,et al.  Response-time Calculation and Priority Assignment with Integer Programming Methods , 2001 .

[119]  Pascal Richard.  Polynomial Time Approximate Schedulability Tests for Fixed-Priority Real-Time Tasks : some numerical experimentations , 2006 .

[120]  John R. Josephson,et al.  Abductive inference : computation, philosophy, technology , 1994 .

[121]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[122]  Lakhdar Sais,et al.  Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem , 2001, CP.

[123]  Michela Milano,et al.  Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces, 27) , 2003 .

[124]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[125]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[126]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[127]  Frode Eika Sandnes,et al.  A hybrid genetic algorithm applied to automatic parallel controller code generation , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[128]  Ignacio E. Grossmann,et al.  Using MILP and CP for the Scheduling of Batch Chemical Processes , 2004, CPAIOR.

[129]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[130]  Michaël Richard.  Contribution à la validation des systèmes temps réel distribués : ordonnancement à priorités fixes et placement , 2002 .

[131]  Nicolas Beldiceanu,et al.  Constraint Logic Programming , 1997 .

[132]  Alberto Bemporad,et al.  SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems , 2004, CPAIOR.

[133]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.