4 Search Results for "Balduccini, Marcello"

Document
DOI: 10.4230/OASIcs.ICLP.2017.7
Understanding Restaurant Stories Using an ASP Theory of Intentions

Authors: Daniela Inclezan, Qinglin Zhang, Marcello Balduccini, and Ankush Israney

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

Abstract
The paper describes an application of logic programming to story understanding. Substantial work in this direction has been done by Erik Mueller, who focused on texts about stereotypical activities (or scripts), in particular restaurant stories. His system performed well, but could not understand texts describing exceptional scenarios. We propose addressing this problem by using a theory of intentions developed by Blount, Gelfond, and Balduccini. We present a methodology in which we model scripts as activities and employ the concept of an intentional agent to reason about both normal and exceptional scenarios.
Cite as

Daniela Inclezan, Qinglin Zhang, Marcello Balduccini, and Ankush Israney. Understanding Restaurant Stories Using an ASP Theory of Intentions. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 7:1-7:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{inclezan_et_al:OASIcs.ICLP.2017.7,
  author =	{Inclezan, Daniela and Zhang, Qinglin and Balduccini, Marcello and Israney, Ankush},
  title =	{{Understanding Restaurant Stories Using an ASP Theory of Intentions}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{7:1--7:4},
  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.7},
  URN =		{urn:nbn:de:0030-drops-84638},
  doi =		{10.4230/OASIcs.ICLP.2017.7},
  annote =	{Keywords: answer set programming, story understanding, theory of intentions}
}
Document
DOI: 10.4230/OASIcs.ICLP.2016.8
An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents

Authors: Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

Abstract
We propose a framework for answering the question of whether statements made by an agent can be believed, in light of observations made over time. The basic components of the framework are a formalism for reasoning about actions, changes, and observations and a formalism for default reasoning. The framework is suitable for concrete implementation, e.g., using answer set programming for asserting the truthfulness of statements made by agents, starting from observations, knowledge about the actions of the agents, and a theory about the "normal" behavior of agents.
Cite as

Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini. An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{caoson_et_al:OASIcs.ICLP.2016.8,
  author =	{Cao Son, Tran and Pontelli, Enrico and Gelfond, Michael and Balduccini, Marcello},
  title =	{{An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{8:1--8:4},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.8},
  URN =		{urn:nbn:de:0030-drops-67383},
  doi =		{10.4230/OASIcs.ICLP.2016.8},
  annote =	{Keywords: Agents, ASP, Reasoning, Knowledge}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2012.49
An Answer Set Solver for non-Herbrand Programs: Progress Report

Authors: Marcello Balduccini

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)

Abstract
In this paper we propose an extension of Answer Set Programming (ASP) by non-Herbrand functions, i.e. functions over non-Herbrand domains, and describe a solver for the new language. Our approach stems for our interest in practical applications, and from the corresponding need to compute the answer sets of programs with non-Herbrand functions efficiently. Our extension of ASP is such that the semantics of the new language is obtained by a comparatively small change to the ASP semantics from [8]. This makes it possible to modify a state-of-the-art ASP solver in an incremental fashion, and use it for the computation of the answer sets of (a large class of) programs of the new language. The computation is rather efficient, as demonstrated by our experimental evaluation.
Cite as

Marcello Balduccini. An Answer Set Solver for non-Herbrand Programs: Progress Report. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{balduccini:LIPIcs.ICLP.2012.49,
  author =	{Balduccini, Marcello},
  title =	{{An Answer Set Solver for non-Herbrand Programs: Progress Report}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{49--60},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.49},
  URN =		{urn:nbn:de:0030-drops-36099},
  doi =		{10.4230/LIPIcs.ICLP.2012.49},
  annote =	{Keywords: Answer Set Programming, non-Herbrand Functions, Answer Set Solving, Knowledge Representation and Reasoning}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2010.14
Learning Domain-Specific Heuristics for Answer Set Solvers

Authors: Marcello Balduccini

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

Abstract
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search algorithm to mistakenly focus on areas of the search space that contain no solutions or very few. When that happens, performance degrades substantially, even to the point that the solver may need to be terminated before returning an answer. This prospect is a concern when one is considering using such a solver in an industrial setting, where users typically expect consistent performance. To overcome this problem, in this paper we propose a technique that allows learning domain-specific heuristics for ASP solvers. The learning is done off-line, on representative instances from the target domain, and the learned heuristics are then used for choice-point selection. In our experiments, the introduction of domain-specific heuristics improved performance on hard instances by up to 3 orders of magnitude (and 2 on average), nearly completely eliminating the cases in which the solver had to be terminated because the wait for an answer had become unacceptable.
Cite as

Marcello Balduccini. Learning Domain-Specific Heuristics for Answer Set Solvers. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 14-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{balduccini:LIPIcs.ICLP.2010.14,
  author =	{Balduccini, Marcello},
  title =	{{Learning Domain-Specific Heuristics for Answer Set Solvers}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{14--23},
  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.14},
  URN =		{urn:nbn:de:0030-drops-25797},
  doi =		{10.4230/LIPIcs.ICLP.2010.14},
  annote =	{Keywords: Answer set programming, solvers, domain-specific heuristics}
}
  • Refine by Author
  • 4 Balduccini, Marcello
  • 1 Cao Son, Tran
  • 1 Gelfond, Michael
  • 1 Inclezan, Daniela
  • 1 Israney, Ankush
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 ASP
  • 1 Agents
  • 1 Answer Set Programming
  • 1 Answer Set Solving
  • 1 Answer set programming
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 1 2010
  • 1 2012
  • 1 2016
  • 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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact