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

prefMaxSAT: exploiting MaxSAT for enumerating preferred extensions

Vallati, Mauro, Cerutti, Federico, Faber, Wolfgang and Giacomin, Massimiliano 2015. prefMaxSAT: exploiting MaxSAT for enumerating preferred extensions. Presented at: System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15), Online, Jan-Jun 2015. Published in: Thimm, Matthias and Villata, Serena eds. System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15). ArXiv Cornell University Press, pp. 1-4.

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

Abstract

In this paper we introduce prefMaxSAT, a solver that exploits an efficient encoding of preferred extensions search for abstract argumentation, using the MaxSAT approach.

Item Type: Conference or Workshop Item (Other)
Date Type: Completion
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Cornell University Press
Date of First Compliant Deposit: 30 March 2016
Last Modified: 04 Jun 2017 08:45
URI: http://orca.cf.ac.uk/id/eprint/84178

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics