2026-09-24T01:10:22Zhttps://cora.ucc.ie/server/oai/request

oai:cora.ucc.ie:10468/5102023-04-04T07:04:51Zcom_10468_388com_10468_5com_10468_227com_10468_1col_10468_389col_10468_511col_10468_140

O'Sullivan, Barry Papadopoulos, Alexandre Science Foundation Ireland 2012-02-02T14:06:50Z 2012-02-02T14:06:50Z 2011-12 2011-07-27 Constraint programming has emerged as a successful paradigm for modelling combinatorial problems arising from practical situations. In many of those situations, we are not provided with an immutable set of constraints. Instead, a user will modify his requirements, in an interactive fashion, until he is satisfied with a solution. Examples of such applications include, amongst others, model-based diagnosis, expert systems, product configurators. The system he interacts with must be able to assist him by showing the consequences of his requirements. Explanations are the ideal tool for providing this assistance. However, existing notions of explanations fail to provide sufficient information. We define new forms of explanations that aim to be more informative. Even if explanation generation is a very hard task, in the applications we consider, we must manage to provide a satisfactory level of interactivity and, therefore, we cannot afford long computational times. We introduce the concept of representative sets of relaxations, a compact set of relaxations that shows the user at least one way to satisfy each of his requirements and at least one way to relax them, and present an algorithm that efficiently computes such sets. We introduce the concept of most soluble relaxations, maximising the number of products they allow. We present algorithms to compute such relaxations in times compatible with interactivity, achieving this by indifferently making use of different types of compiled representations. We propose to generalise the concept of prime implicates to constraint problems with the concept of domain consequences, and suggest to generate them as a compilation strategy. This sets a new approach in compilation, and allows to address explanation-related queries in an efficient way. We define ordered automata to compactly represent large sets of domain consequences, in an orthogonal way from existing compilation techniques that represent large sets of solutions. Not peer reviewed Accepted Version application/pdf Papadopoulos, A. 2011. Computing explanations for interactive constraint-based systems. PhD Thesis, University College Cork. https://hdl.handle.net/10468/510 en University College Cork http://library.ucc.ie/record=b2028173~S0 © 2011, Alexandre Papadopoulos http://creativecommons.org/licenses/by-nc-nd/3.0/ Explanations Configuration Constraint programming (Computer science) Computing explanations for interactive constraint-based systems Doctoral thesis Doctoral PhD (Computer Science)info:eu-repo/semantics/openAccess