Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver

Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper briefly describes the solver ASPrMin, which enumerates preferred extensions and scored first in the Extension Enumeration problem—the only one implemented—of the Preferred Semantics Track of the Second International Competition on Computational Models of Argumentation, ICCMA17.
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2018
EditorsSanjay Modgil, Katarzyna Budzynska, John Lawrence
PublisherIOS Press
Pages459-460
Number of pages2
ISBN (Electronic)9781614999065
ISBN (Print) 9781614999058
DOIs
Publication statusPublished - 6 Sep 2018
Event7th International Conference on Computational Models of Argument - Warsaw, Poland
Duration: 11 Sep 201814 Sep 2018
http://comma2018.argdiap.pl/ (Link to Conference Website)

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press

Conference

Conference7th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2018
CountryPoland
CityWarsaw
Period11/09/1814/09/18
Internet address

    Fingerprint

Cite this

Faber, W., Vallati, M., Cerutti, F., & Giacomin, M. (2018). Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver. In S. Modgil, K. Budzynska, & J. Lawrence (Eds.), Computational Models of Argument: Proceedings of COMMA 2018 (pp. 459-460). (Frontiers in Artificial Intelligence and Applications). IOS Press. https://doi.org/10.3233/978-1-61499-906-5-459