2 Search Results for "Alviano, Mario"


Document
The Pyglaf Argumentation Reasoner

Authors: Mario Alviano

Published in: OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)


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

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)


Copy BibTex To Clipboard

@InProceedings{alviano:OASIcs.ICLP.2017.2,
  author =	{Alviano, Mario},
  title =	{{The Pyglaf Argumentation Reasoner}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{2:1--2:3},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.2},
  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}
}
Document
Dynamic Magic Sets for Disjunctive Datalog Programs

Authors: Mario Alviano

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)


Abstract
Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negation in bodies. Magic Sets are a technique for optimizing query answering over logic programs and have been originally defined for standard Datalog, that is, ASP without disjunction and negation. Essentially, the input program is rewritten in order to identify a subset of the program instantiation which is sufficient for answering the query. Dynamic Magic Sets (DMS) are an extension of this technique to ASP. The optimization provided by DMS can be exploited also during the nondeterministic phase of ASP systems. In particular, after some assumptions have been made during the computation, parts of the program may become irrelevant to a query (because of these assumptions). This allows for dynamic pruning of the search space, which may result in exponential performance gains. DMS has been implemented in the dlv system and experimental results confirm the effectiveness of the technique.

Cite as

Mario Alviano. Dynamic Magic Sets for Disjunctive Datalog Programs. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 226-235, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InProceedings{alviano:LIPIcs.ICLP.2010.226,
  author =	{Alviano, Mario},
  title =	{{Dynamic Magic Sets for Disjunctive Datalog Programs}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{226--235},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.226},
  URN =		{urn:nbn:de:0030-drops-26012},
  doi =		{10.4230/LIPIcs.ICLP.2010.226},
  annote =	{Keywords: Answer set programming, decidability, magic sets, disjunctive logic programs}
}
  • Refine by Author
  • 2 Alviano, Mario

  • Refine by Classification

  • Refine by Keyword
  • 1 Answer set programming
  • 1 abstract argumentation frameworks
  • 1 decidability
  • 1 disjunctive logic programs
  • 1 incremental solving
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2010
  • 1 2018

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