QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user of an interactive application, however, desires explanations and relaxations containing the most important constraints. To address this need, we define preferred explanations and relaxations based on user preferences between constraints and we compute them by a generic method which works for arbitrary CP, SAT, or DL solvers. We significantly accelerate the basic method by a divide-and-conquer strategy and thus provide the technological basis for the explanation facility of a principal industrial constraint programming tool, which is, for example, used in numerous configuration applications.

References in zbMATH (referenced in 32 articles )

Showing results 1 to 20 of 32.
Sorted by year (citations)

1 2 next

  1. Rodler, Patrick: Memory-limited model-based diagnosis (2022)
  2. Ignatiev, Alexey; Marques-Silva, Joao: SAT-based rigorous explanations for decision lists (2021)
  3. Karlsson, Emil; Rönnberg, Elina: Strengthening of feasibility cuts in logic-based benders decomposition (2021)
  4. Mencía, Carlos; Marques-Silva, Joao: Reasoning about strong inconsistency in ASP (2020)
  5. Dodaro, Carmine; Gasteiger, Philip; Reale, Kristian; Ricca, Francesco; Schekotihin, Konstantin: Debugging non-ground ASP programs: technique and graphical tools (2019)
  6. Labreuche, Christophe: Explaining hierarchical multi-linear models (2019)
  7. Freuder, Eugene C.: Progress towards the Holy Grail (2018)
  8. Kazakov, Yevgeny; Skočovský, Peter: Enumerating justifications using resolution (2018)
  9. Marques-Silva, Joao; Malik, Sharad: Propositional SAT solving (2018)
  10. Alviano, Mario: Model enumeration in propositional circumscription via unsatisfiable core analysis (2017)
  11. Marques-Silva, Joao; Janota, Mikoláš; Mencía, Carlos: Minimal sets on propositional formulae. Problems and reductions (2017)
  12. Puranik, Yash; Sahinidis, Nikolaos V.: Deletion presolve for accelerating infeasibility diagnosis in optimization models (2017)
  13. Van Hertum, Pieter; Dasseville, Ingmar; Janssens, Gerda; Denecker, Marc: The KB paradigm and its application to interactive configuration (2017)
  14. Jamil, Noreen; Müller, Johannes; Naeem, M. Asif; Lutteroth, Christof; Weber, Gerald: Extending linear relaxation for non-square matrices and soft constraints (2016)
  15. Liffiton, Mark H.; Previti, Alessandro; Malik, Ammar; Marques-Silva, Joao: Fast, flexible MUS enumeration (2016)
  16. Mencía, Carlos; Ignatiev, Alexey; Previti, Alessandro; Marques-Silva, Joao: MCS extraction with sublinear oracle queries (2016)
  17. Arif, M. Fareed; Mencía, Carlos; Marques-Silva, Joao: Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing (2015)
  18. Grégoire, Éric; Lagniez, Jean-Marie; Mazure, Bertrand: On getting rid of the preprocessing minimization step in MUC-finding algorithms (2015)
  19. Mencía, Carlos; Previti, Alessandro; Marques-Silva, Joao: SAT-based Horn least upper bounds (2015)
  20. Quesada, Luis; Sitanayah, Lanny; Brown, Kenneth N.; O’Sullivan, Barry; Sreenan, Cormac J.: A constraint programming approach to the additional relay placement problem in wireless sensor networks (2015)

1 2 next