Search:
Computing and Library Services - delivering an inspiring information environment

Strong Equivalence of Qualitative Optimization Problems

Faber, Wolfgang, Truszczyński, Miroslaw and Woltran, Stefan (2013) Strong Equivalence of Qualitative Optimization Problems. Journal of Artificial Intelligence Research, 47. pp. 351-391. ISSN 1076 - 9757

[img] PDF - Published Version
Download (430kB)

Abstract

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.

Item Type: Article
Subjects: T Technology > T Technology (General)
Schools: School of Computing and Engineering
Depositing User: Cherry Edmunds
Date Deposited: 20 Sep 2013 14:44
Last Modified: 07 Nov 2015 16:50
URI: http://eprints.hud.ac.uk/id/eprint/18497

Downloads

Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©