activity
20222026
most citedOn the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2026

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…

cs.AI2025★ 1 cited

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…

cs.AI2025

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…

cs.AI2025

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…

cs.AI2025

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…

math.LO2024

Analogues of the countable Borel equivalence relations in the setting of computable reducibility

Uri Andrews, Luca San Mauro

Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence r…

math.LO2022★ 1 cited

Investigating the computable Friedman-Stanley jump

Uri Andrews, Luca San Mauro

We answer several questions about the computable Friedman-Stanley jump on equivalence relations. This jump, introduced by Clemens, Coskey, and Krakoff, deepens the natural connecti…