On Exploiting Hitting Sets for Model Reconciliation
Stylianos Loukas Vasileiou, Alessandro Previti, William Yeoh
摘要
In human-aware planning, a planning agent may need to provide an explanation to a human user on why its plan is optimal. A popular approach to do this is called model reconciliation, where the agent tries to reconcile the differences in its model and the human's model such that the plan is also optimal in the human's model. In this paper, we present a logicbased framework for model reconciliation that extends beyond the realm of planning. More specifically, given a knowledge base KB1 entailing a formula ϕ and a second knowledge base KB2 not entailing it, model reconciliation seeks an explanation, in the form of a cardinality-minimal subset of KB1, whose integration into KB2 makes the entailment possible. Our approach, based on ideas originating in the context of analysis of inconsistencies, exploits the existing hitting set duality between minimal correction sets (MCSes) and minimal unsatisfiable sets (MUSes) in order to identify an appropriate explanation. However, differently from those works targeting inconsistent formulas, which assume a single knowledge base, MCSes and MUSes are computed over two distinct knowledge bases. We conclude our paper with an empirical evaluation of the newly introduced approach on planning instances, where we show how it outperforms an existing stateof-the-art solver, and generic non-planning instances from recent SAT competitions, for which no other solver exists. * This paper has been published in AAAI 2021.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Does Your AI Agent Get You? A Personalizable Framework for Approximating Human Models from Argumentation-based Dialogue TracesYinxu Tang, Stylianos Loukas Vasileiou, William YeohAAAI 2025 · 被引用 6 次
- Model Reconciliation via Cost-Optimal Explanations in Probabilistic Logic ProgrammingYinxu Tang, Stylianos Loukas Vasileiou, Vincent Derkinderen, William YeohNeurIPS 2025 · 被引用 1 次
相关 Paper
- Computing Syntax Tree-based Minimal Unsatisfiable Cores of LTLf FormulasValeria Fionda, Antonio Ielo, Francesco RiccaAAAI 2026
- Exploiting Symmetries in MUS ComputationIgnace Bleukx, Hélène Verhaeghe, Bart Bogaerts, Tias GunsAAAI 2025 · 被引用 1 次
- Explanations for Inconsistency-Tolerant Query Answering under Existential RulesThomas Lukasiewicz, Enrico Malizia, Cristian MolinaroAAAI 2020 · 被引用 21 次
- Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP SolvingJavier Larrosa, Conrado Martínez, Emma RollonAAAI 2024 · 被引用 2 次
- Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set ApproachHannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg 等AAAI 2026
