定性最优化问题的强等价性
Strong Equivalence of Qualitative Optimization Problems
摘要:
我们引入定性优化问题(或简单地说,优化问题)的框架来表示偏好理论。形式主义使用单独的模块来描述要比较的结果的空间(生成器)和对结果的偏好(选择器)。我们考虑两种类型的优化问题。它们的不同之处在于生成器的解释方式,我们用命题理论对生成器进行建模:用标准命题逻辑语义和用均衡模型(答案集)语义。在生成元的后一种解释下,优化问题直接推广了以前提出的解集优化程序。我们研究了优化问题的强等价性,这保证了它们在任何更大范围内的可扩展性。我们描述了几个版本的强等价通过限制类的优化问题,可以用作扩展,并建立相关的推理任务的复杂性。理解强等价对于优化问题的模块化表示和重写技术是必不可少的,以简化它们而不改变它们的固有属性。
英文摘要:
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and the preferences on outcomes (the selector). We consider two types of optimization problems. They differ in the way the generator, which we model by a propositional theory, is interpreted: by the standard propositional logic semantics, and by the equilibrium-model (answer-set) semantics. Under the latter interpretation of generators, optimization problems directly generalize answer-set optimization programs proposed previously. We study strong equivalence of optimization problems, which guarantees their interchangeability within any larger context. We characterize several versions of strong equivalence obtained by restricting the class of optimization problems that can be used as extensions and establish the complexity of associated reasoning tasks. Understanding strong equivalence is essential for modular representation of optimization problems and rewriting techniques to simplify them without changing their inherent properties.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。