20 citations · 54 across the 26 of their papers we have counts for
6 papers · 1 filter
On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks
Uri Andrews, Luca San Mauro
Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We u…
Complexity in finitary argumentation (extended version)
Uri Andrews, Luca San Mauro
Abstract argumentation frameworks (AFs) provide a formal setting to analyze many forms of reasoning with conflicting information. While the expressiveness of general infinite AFs m…
On statistical learning of graphs
Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro +1
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds…
SCC-recursiveness in infinite argumentation (extended version)
Uri Andrews, Luca San Mauro
Argumentation frameworks (AFs) are a foundational tool in artificial intelligence for modeling structured reasoning and conflict. SCC-recursiveness is a well-known design principle…
Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version)
Uri Andrews, Luca San Mauro
Dialectical systems are a mathematical formalism for modeling an agent updating a knowledge base seeking consistency. Introduced in the 1970s by Roberto Magari, they were originall…
On the learning power of Friedman-Stanley jumps
Vittorio Cipriani, Alberto Marcone, Luca San Mauro
Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learni…