Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Solving set optimization problems by cardinality optimization via weak constraints with an application to argumentation

Faber, Wolfgang, Vallati, Mauro, Cerutti, Federico and Giacomin, Massimiliano 2016. Solving set optimization problems by cardinality optimization via weak constraints with an application to argumentation. Presented at: Workshop on Trends and Applications of Answer Set Programming, Klagenfurt, Austria, 26 September 2016.

[img]
Preview
PDF - Accepted Post-Print Version
Download (294kB) | Preview

Abstract

Optimization—minimization or maximization—in the lattice of subsets is a frequent operation in Artificial Intelligence tasks. Examples are subset-minimal model-based diagnosis, nonmonotonic reasoning by means of circumscription, or preferred extensions in abstract argumentation. Finding the optimum among many admissible solutions is often harder than finding admissible solutions with respect to both computational complexity and methodology. This paper addresses the former issue by means of an effective method for finding subset-optimal solutions. It is based on the relationship between cardinality-optimal and subset-optimal solutions, and the fact that many logic-based declarative programming systems provide constructs for finding cardinality-optimal solutions, for example maximum satisfiability (MaxSAT) or weak constraints in Answer Set Programming (ASP). Clearly each cardinality-optimal solution is also a subset-optimal one, and if the language also allows for the addition of particular restricting constructs (both MaxSAT and ASP do) then all subset-optimal solutions can be found by an iterative computation of cardinality-optimal solutions. As a showcase, the computation of preferred extensions of abstract argumentation frameworks using the proposed method is studied.

Item Type: Conference or Workshop Item (Paper)
Status: Unpublished
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date of First Compliant Deposit: 19 August 2016
Last Modified: 04 Jun 2017 09:21
URI: http://orca.cf.ac.uk/id/eprint/93826

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics