Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver

Wolfgang Faber; Mauro Vallati; Federico Cerutti; Massimiliano Giacomin

doi:10.3233/978-1-61499-906-5-459

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 proceeding › Conference contribution › peer-review

3 Citations (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 language	English
Title of host publication	Computational Models of Argument
Subtitle of host publication	Proceedings of COMMA 2018
Editors	Sanjay Modgil, Katarzyna Budzynska, John Lawrence
Publisher	IOS Press
Pages	459-460
Number of pages	2
ISBN (Electronic)	9781614999065
ISBN (Print)	9781614999058
DOIs	https://doi.org/10.3233/978-1-61499-906-5-459
Publication status	Published - 6 Sep 2018
Event	7th International Conference on Computational Models of Argument - Warsaw, Poland Duration: 11 Sep 2018 → 14 Sep 2018 Conference number: 7 http://comma2018.argdiap.pl/ (Link to Conference Website)

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Publisher	IOS Press

Conference

Conference	7th International Conference on Computational Models of Argument
Abbreviated title	COMMA 2018
Country/Territory	Poland
City	Warsaw
Period	11/09/18 → 14/09/18
Internet address	http://comma2018.argdiap.pl/ (Link to Conference Website)

Access to Document

10.3233/978-1-61499-906-5-459Licence: CC BY-NC

asprmin-comma-2018Accepted author manuscript, 192 KBLicence: CC BY-NC

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

@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 = sep,

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",

note = "7th International Conference on Computational Models of Argument, COMMA 2018 ; Conference date: 11-09-2018 Through 14-09-2018",

url = "http://comma2018.argdiap.pl/",

}

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 et al.

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 proceeding › Conference contribution › peer-review

TY - GEN

T1 - Enumerating Preferred Extensions Using ASP Domain Heuristics

T2 - 7th International Conference on Computational Models of Argument

AU - Faber, Wolfgang

AU - Vallati, Mauro

AU - Cerutti, Federico

AU - Giacomin, Massimiliano

N1 - Conference code: 7

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

Y2 - 11 September 2018 through 14 September 2018

ER -

Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this