Conference

Understanding ProbLog as Probabilistic Argumentation
We show that ProbLog is an instance of a form of Probabilistic Abstract Argumentation (PAA) that builds upon Assumption-Based Argumentation (ABA). The connections pave the way towards equipping ProbLog with alternative semantics, inherited from PAA and ABA.
Francesca Toni, Nico Potyka, Markus Ulbricht, Pietro Totis
PDF Cite DOI URL
Mapping Probability Word Problems to Executable Representations
We analyze different neural models to solve probability math word problems in two ways. First, to predict directly the answer in an end-to-end fashion. Second, to map the text to a formal representation used by a probabilistic programming system to compute the answer.
Simon Suster, Pieter Fivez, Pietro Totis, Angelika Kimmig, Jesse Davis, Luc De Raedt, Walter Daelemans
PDF Cite Project Video DOI URL
Mining Italian Short Argumentative Texts
We present the first model for argumentation mining for Italian short argumentative texts. We adapted to Italian the software …
Ivan Namor, Pietro Totis, Samuele Garda, Manfred Stede
PDF Cite
Towards Distributed Computation of Answer Sets
Answer Set Programming (ASP) is a logic programming language widely used in non-monotonic automated reasoning. Thanks to its …
Marco De Bortoli, Federico Igne, Fabio Tardivo, Pietro Totis, Agostino Dovier, Enrico Pontelli
PDF Cite
Classifying Italian newspaper text: news or editorial?
We present a text classifier that can distinguish Italian news stories from editorials. Inspired by earlier work on English, we built a …
Pietro Totis, Manfred Stede
PDF Cite