Document Open Access Logo

The Pyglaf Argumentation Reasoner

Author Mario Alviano

PDF

File

Thumbnail PDF
PDF
OASIcs.ICLP.2017.2.pdf
  • Filesize: 359 kB
  • 3 pages

Document Identifiers

Subject Classification

Keywords
  • abstract argumentation frameworks
  • propositional circumscription
  • minimal model enumeration
  • incremental solving

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Mario Alviano. The Pyglaf Argumentation Reasoner. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 2:1-2:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/OASIcs.ICLP.2017.2

Author Details

Mario Alviano

References

  1. Mario Alviano. Model enumeration in propositional circumscription via unsatisfiable core analysis. TPLP, 17, 2017. To appear. URL: https://arxiv.org/abs/1707.01423.
  2. Mario Alviano and Carmine Dodaro. Answer set enumeration via assumption literals. In Giovanni Adorni, Stefano Cagnoni, Marco Gori, and Marco Maratea, editors, AI*IA 2016: Advances in Artificial Intelligence - XVth International Conference of the Italian Association for Artificial Intelligence, Genova, Italy, November 29 - December 1, 2016, Proceedings, volume 10037 of Lecture Notes in Computer Science, pages 149-163. Springer, 2016. URL: http://dx.doi.org/10.1007/978-3-319-49130-1_12.
  3. Mario Alviano and Carmine Dodaro. Anytime answer set optimization via unsatisfiable core shrinking. TPLP, 16(5-6):533-551, 2016. URL: http://dx.doi.org/10.1017/S147106841600020X.
  4. Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, and Francesco Ricca. WASP: A native ASP solver based on constraint learning. In Pedro Cabalar and Tran Cao Son, editors, Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, volume 8148 of Lecture Notes in Computer Science, pages 54-66. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-40564-8_6.
  5. Mario Alviano, Carmine Dodaro, Nicola Leone, and Francesco Ricca. Advances in WASP. In Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski, editors, Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings, volume 9345 of Lecture Notes in Computer Science, pages 40-54. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-319-23264-5_5.
  6. Mario Alviano, Carmine Dodaro, and Francesco Ricca. A maxsat algorithm using cardinality constraints of bounded size. In Qiang Yang and Michael Wooldridge, editors, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 2677-2683. AAAI Press, 2015. URL: http://ijcai.org/Abstract/15/379.
  7. Gilles Audemard and Laurent Simon. Predicting learnt clauses quality in modern SAT solvers. In Craig Boutilier, editor, IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 399-404, 2009. URL: http://ijcai.org/Proceedings/09/Papers/074.pdf.
  8. Carmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, and Marco Sirianni. The birth of a WASP: preliminary report on a new ASP solver. In Fabio Fioravanti, editor, Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31 - September 2, 2011, volume 810 of CEUR Workshop Proceedings, pages 99-113. CEUR-WS.org, 2011. URL: http://ceur-ws.org/Vol-810/paper-l06.pdf.
  9. John McCarthy. Circumscription - A form of non-monotonic reasoning. Artif. Intell., 13(1-2):27-39, 1980. URL: http://dx.doi.org/10.1016/0004-3702(80)90011-9.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact