9 papers
The tolerant learning hierarchy for c.e. sets
Vittorio Cipriani, Martin Ritter, Luca San Mauro
Learning from positive data models a scenario in which a learner receives longer and longer initial segments of an enumeration of an unknown set and repeatedly outputs a conjecture…
Tenability and Weak Semantics: Modeling Non-uniform Defense -- Extended Version
Uri Andrews, Luca San Mauro, John Spoerl
In Dung-style abstract argumentation, various semantics capture notions of acceptability of arguments. The admissibility semantics capture the notion that an argument can be consis…
Isomorphism relations on classes of c.e. algebras
Meng-Che "Turbo" Ho, Martin Ritter, Luca San Mauro
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations --…
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…