Human-Centred Feasibility Restoration

Decision systems for solving real-world combinatorial problems must be able to report infeasibility in such a way that users can understand the reasons behind it, and understand how to modify the problem to restore feasibility. Current methods mainly focus on reporting one or more subsets of the problem constraints that cause infeasibility. Methods that also show users how to restore feasibility tend to be less flexible and/or problem-dependent. We describe a problem-independent approach to feasibility restoration that combines existing techniques from the literature in novel ways to yield meaningful, useful, practical and flexible user support. We evaluate the resulting framework on two real-world applications. 2012 ACM Subject Classification Theory of computation → Constraint and logic programming; Theory of computation → Integer programming

[1]  Andreas A. Falkner,et al.  Solver Requirements for Interactive Configuration , 2020, J. Univers. Comput. Sci..

[2]  Guido Tack,et al.  Debugging Unsatisfiable Constraint Models , 2017, CPAIOR.

[3]  Niklas T. Lauffer,et al.  Human-Understandable Explanations of Infeasibility for Resource-Constrained Scheduling Problems , 2019 .

[4]  Jean-Charles Régin,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems , 2004, Lecture Notes in Computer Science.

[5]  Joao Marques-Silva,et al.  On Computing Preferred MUSes and MCSes , 2014, SAT.

[6]  Joyce van Loon.  Irreducibly inconsistent systems of linear inequalities , 1981 .

[7]  Karem A. Sakallah,et al.  Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints , 2007, Journal of Automated Reasoning.

[8]  Matthias Klapperstück,et al.  Process Plant Layout Optimization: Equipment Allocation , 2018, CP.

[9]  Peter J. Stuckey,et al.  Improved Linearization of Constraint Programming Models , 2016, CP.

[10]  Jennifer Ryan,et al.  Identifying Minimally Infeasible Subsystems of Inequalities , 1990, INFORMS J. Comput..

[11]  Ulrich Junker.  Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .

[12]  María Teresa Gómez López,et al.  NMUS: Structural Analysis for Improving the Derivation of All MUSes in Overconstrained Numeric CSPs , 2007, CAEPIA.

[13]  Mikolás Janota,et al.  Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence On Computing Minimal Correction Subsets , 2022 .

[14]  Mark H. Liffiton,et al.  Enumerating Infeasibility: Finding Multiple MUSes Quickly , 2013, CPAIOR.

[15]  Alexander Felfernig,et al.  An efficient diagnosis algorithm for inconsistent constraint sets , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[16]  Jian Yang,et al.  Infeasibility resolution based on goal programming , 2008, Comput. Oper. Res..

[17]  Alexander Knapp,et al.  MiniBrass: Soft constraints for MiniZinc , 2018, Constraints.

[18]  Barry O'Sullivan,et al.  Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems , 2015, ICTAC.

[19]  Fahiem Bacchus,et al.  Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets , 2015, CAV.

[20]  Eugene C. Freuder.  Explaining Ourselves: Human-Aware Constraint Reasoning , 2017, AAAI.

[21]  Iain Dunning,et al.  JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..

[22]  John W. Chinneck,et al.  Analyzing Infeasible Mixed-Integer and Integer Linear Programs , 1999, INFORMS J. Comput..

[23]  John W. Chinneck,et al.  The maximum feasible subset problem (maxFS) and applications , 2019, INFOR Inf. Syst. Oper. Res..

[24]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[25]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[26]  Hadrien Cambazard,et al.  Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming , 2004, PATAT.