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

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

Semantics

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
Faber, Wolfgang ; Vallati, Mauro ; Cerutti, Federico ; Giacomin, Massimiliano. / Enumerating Preferred Extensions Using ASP Domain Heuristics : The ASPrMin Solver. Computational Models of Argument: Proceedings of COMMA 2018. editor / Sanjay Modgil ; Katarzyna Budzynska ; John Lawrence. IOS Press, 2018. pp. 459-460 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{36492504dad24635b78640de4c40781f,
title = "Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver",
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.",
keywords = "Argumentation, Solver, ASP",
author = "Wolfgang Faber and Mauro Vallati and Federico Cerutti and Massimiliano Giacomin",
year = "2018",
month = "9",
day = "6",
doi = "10.3233/978-1-61499-906-5-459",
language = "English",
isbn = "9781614999058",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "459--460",
editor = "Sanjay Modgil and Katarzyna Budzynska and John Lawrence",
booktitle = "Computational Models of Argument",
address = "Netherlands",

}

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. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 459-460, 7th International Conference on Computational Models of Argument, Warsaw, Poland, 11/09/18. https://doi.org/10.3233/978-1-61499-906-5-459

Enumerating Preferred Extensions Using ASP Domain Heuristics : The ASPrMin Solver. / Faber, Wolfgang; Vallati, Mauro; Cerutti, Federico; Giacomin, Massimiliano.

Computational Models of Argument: Proceedings of COMMA 2018. ed. / Sanjay Modgil; Katarzyna Budzynska; John Lawrence. IOS Press, 2018. p. 459-460 (Frontiers in Artificial Intelligence and Applications).

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

TY - GEN

T1 - Enumerating Preferred Extensions Using ASP Domain Heuristics

T2 - The ASPrMin Solver

AU - Faber, Wolfgang

AU - Vallati, Mauro

AU - Cerutti, Federico

AU - Giacomin, Massimiliano

PY - 2018/9/6

Y1 - 2018/9/6

N2 - 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.

AB - 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.

KW - Argumentation

KW - Solver

KW - ASP

UR - http://www.scopus.com/inward/record.url?scp=85053932721&partnerID=8YFLogxK

U2 - 10.3233/978-1-61499-906-5-459

DO - 10.3233/978-1-61499-906-5-459

M3 - Conference contribution

SN - 9781614999058

T3 - Frontiers in Artificial Intelligence and Applications

SP - 459

EP - 460

BT - Computational Models of Argument

A2 - Modgil, Sanjay

A2 - Budzynska, Katarzyna

A2 - Lawrence, John

PB - IOS Press

ER -

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