License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2017.2
URN: urn:nbn:de:0030-drops-84546
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8454/
Alviano, Mario
The Pyglaf Argumentation Reasoner
Abstract
The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks.
In fact, many of these problems are reduced to circumscription by means of linear encodings, and a few others are solved by means of a sequence of calls to an oracle for circumscription.
Within pyglaf, Python is used to build the encodings and to control the execution of the external circumscription solver, which extends the SAT solver glucose and implements an algorithm based on unsatisfiable core analysis.
BibTeX - Entry
@InProceedings{alviano:OASIcs:2018:8454,
author = {Mario Alviano},
title = {{The Pyglaf Argumentation Reasoner}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {2:1--2:3},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Ricardo Rocha and Tran Cao Son and Christopher Mears and Neda Saeedloei},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8454},
URN = {urn:nbn:de:0030-drops-84546},
doi = {10.4230/OASIcs.ICLP.2017.2},
annote = {Keywords: abstract argumentation frameworks, propositional circumscription, minimal model enumeration, incremental solving}
}
|
Keywords: |
|
abstract argumentation frameworks, propositional circumscription, minimal model enumeration, incremental solving |
|
Collection: |
|
Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
14.02.2018 |
