Simplifying step-wise explanation sequences
Explaining constraint programs is useful for debugging an unsatisfiable program, to
understand why a given solution is optimal, or to understand how to find a unique solution. A …
understand why a given solution is optimal, or to understand how to find a unique solution. A …
Paths, Proofs, and Perfection: Develo** a Human-Interpretable Proof System for Constrained Shortest Paths
People want to rely on optimization algorithms for complex decisions but verifying the
optimality of the solutions can then become a valid concern, particularly for critical decisions …
optimality of the solutions can then become a valid concern, particularly for critical decisions …
Trustworthy and Explainable Decision-Making for Workforce allocation
G Povéda, R Boumazouza, A Strahl, M Hall… - ar** a decision-making tool designed …
Explaining soft-goal conflicts through constraint relaxations
Recent work suggests to explain trade-offs between soft goals in terms of their conflicts, ie,
minimal unsolvable soft-goal subsets. But this does not explain the conflicts themselves …
minimal unsolvable soft-goal subsets. But this does not explain the conflicts themselves …
Human-centred feasibility restoration in practice
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 determine …
infeasibility in such a way that users can understand the reasons behind it, and determine …
Objective-Based Counterfactual Explanations for Linear Discrete Optimization
Given a user who asks why an algorithmic decision did not satisfy some conditions, a
counterfactual explanation takes the form of a minimally perturbed input that would have led …
counterfactual explanation takes the form of a minimally perturbed input that would have led …
Counterfactual Explanations for Discrete Optimization
AP Korikov - 2022 - search.proquest.com
This thesis develops the first application of counterfactual explanations to optimal solutions
of discrete optimization problems. The techniques studied respond to a contrastive question …
of discrete optimization problems. The techniques studied respond to a contrastive question …
Efficiently Approximating High-Dimensional Pareto Frontiers for Tree-Structured Networks Using Expansion and Compression
CP Gomes - … Artificial Intelligence, and Operations Research: 20th …, 2023 - books.google.com
Real-world decision-making often involves working with many distinct objectives. However,
as we consider a larger number of objectives, performance degrades rapidly and many …
as we consider a larger number of objectives, performance degrades rapidly and many …