On Robustness in Qualitative Constraint Networks

We introduce and study a notion of robustness in Qualitative Constraint Networks (QCNs), which are typically used to represent and reason about abstract spatial and temporal information. In particular, given a QCN, we are interested in obtaining a robust qualitative solution, or, a robust scenario of it, which is a satisfiable scenario that has a higher perturbation tolerance than any other, or, in other words, a satisfiable scenario that has more chances than any other to remain valid after it is altered. This challenging problem requires to consider the entire set of satisfiable scenarios of a QCN, whose size is usually exponential in the number of constraints of that QCN; however, we present a first algorithm that is able to compute a robust scenario of a QCN using linear space in the number of constraints. Preliminary results with a dataset from the job-shop scheduling domain, and a standard one, show the interest of our approach and highlight the fact that not all solutions are created equal.

[1]  Carl Marcus Wallenburg,et al.  Dealing with supply chain risks Linking risk management practices and strategies to performance , 2017 .

[2]  Carl P. L. Schultz,et al.  Visual Explanation by High-Level Abduction: On Answer-Set Programming Driven Reasoning about Moving Objects , 2017, AAAI.

[3]  Mehul Bhatt,et al.  Semantic Question-Answering with Video and Eye-Tracking Data: AI Foundations for Human Visual Perception Driven Cognitive Film Studies , 2016, IJCAI.

[4]  Miguel A. Salido,et al.  Robust Solutions in Changing Constraint Satisfaction Problems , 2010, IEA/AIE.

[5]  Jae Hee Lee,et al.  A Survey of Qualitative Spatial and Temporal Calculi , 2016, ACM Comput. Surv..

[6]  Mehul Bhatt,et al.  Out of Sight But Not Out of Mind: An Answer Set Programming Based Online Abduction Framework for Visual Sensemaking in Autonomous Driving , 2019, IJCAI.

[7]  Till Mossakowski,et al.  Algebraic Properties of Qualitative Spatio-temporal Calculi , 2013, COSIT.

[8]  Marco Ragni,et al.  Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs , 2005, KI.

[9]  Mehul Bhatt,et al.  Spatio-terminological Inference for the Design of Ambient Environments , 2009, COSIT.

[10]  Stability , 1973 .

[11]  Alexander Reinefeld,et al.  Effective Solution of Qualitative Interval Constraint Problems , 1992, Artif. Intell..

[12]  Robin Hirsch,et al.  A Finite Relation Algebra with Undecidable Network Satisfaction Problem , 1999, Log. J. IGPL.

[13]  P. D. Ozonia,et al.  Sydney , 1916 .

[14]  Matthew L. Ginsberg,et al.  Supermodels and Robustness , 1998, AAAI/IAAI.

[15]  Anthony G. Cohn,et al.  Qualitative Simulation Based on a Logical Formalism of Space and Time , 1992, AAAI.

[16]  Gérard Verfaillie,et al.  Constraint Solving in Uncertain and Dynamic Environments: A Survey , 2005, Constraints.

[17]  Sanjiang Li,et al.  Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning , 2012, CP.

[18]  Aristides Gionis,et al.  Discovering recurring activity in temporal networks , 2017, Data Mining and Knowledge Discovery.

[19]  Gérard Ligozat,et al.  What Is a Qualitative Calculus? A General Framework , 2004, PRICAI.

[20]  James Pustejovsky,et al.  Combining Deep Learning and Qualitative Spatial Reasoning to Learn Complex Structures from Sparse Examples with Noise , 2018, AAAI.

[21]  Richard J. Wallace,et al.  Robustness and Stability in Constraint Programming under Dynamism and Uncertainty , 2014, J. Artif. Intell. Res..