default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Cerutti 0001
- > Home > Persons > Federico Cerutti 0001
Publications
- 2024
[j27]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin
:
On generalized notions of consistency and reinstatement and their preservation in formal argumentation. Artif. Intell. 336: 104202 (2024)- [c81]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
Spurious preferences in structured argumentation: a preliminary analysis. AI³@AI*IA 2024 - 2023
- [j22]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
Decomposing Semantics in Abstract Argumentation. FLAP 10(3): 341-392 (2023) - [c75]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
Positiveness and Skepticism in Abstract Argumentation: A First Approach. AI³@AI*IA 2023 - 2022
- [c68]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
Generalizing Consistency and Reinstatement in Abstract Argumentation. AI³@AI*IA 2022 - [c67]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
A Generalized Notion of Consistency with Applications to Formal Argumentation. COMMA 2022: 56-67 - [i22]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Lance M. Kaplan, Murat Sensoy:
Research Note on Uncertain Probabilities and Abstract Argumentation. CoRR abs/2208.10932 (2022) - 2021
- [c63]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin:
Constructing Local Functions to Decompose Argumentation Semantics: Preliminary Results. AI³@AI*IA 2021 - [c60]Massimiliano Giacomin, Pietro Baroni, Federico Cerutti:
Towards a General Theory of Decomposability in Abstract Argumentation. CLAR 2021: 169-189 - [c58]Pietro Baroni, Federico Cerutti, Daniela Fogli, Massimiliano Giacomin, Francesco Gringoli, Giovanni Guida, Paul Sullivan:
Self-Aware Effective Identification and Response to Viral Cyber Threats. CyCon 2021: 353-370 - 2020
- [c53]Tobia Zanetti, Massimiliano Giacomin, Mauro Vallati, Federico Cerutti:
An Efficient Algorithm for Admissible Argumentation Stages. AI³@AI*IA 2020: 45-59 - [c52]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Tobia Zanetti:
An Efficient Algorithm for Semi-stable Extensions. AI*IA 2020: 117-135 - 2019
- [j17]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati:
How we designed winning algorithms for abstract argumentation and which insight we attained. Artif. Intell. 276: 1-40 (2019) - [j14]Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Predictive models and abstract argumentation: the case of high-complexity semantics. Knowl. Eng. Rev. 34: e6 (2019) - 2018
- [j12]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
On the impact of configuration on abstract argumentation automated reasoning. Int. J. Approx. Reason. 92: 120-138 (2018) - [c40]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver. COMMA 2018: 459-460 - [i9]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Giovanni Guida:
AFRA: Argumentation framework with recursive attacks. CoRR abs/1810.04886 (2018) - [i8]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Automata for Infinite Argumentation Structures. CoRR abs/1810.04892 (2018) - 2017
- [j10]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
An Efficient Java-Based Solver for Abstract Argumentation Frameworks: jArgSemSAT. Int. J. Artif. Intell. Tools 26(2): 1750002:1-1750002:26 (2017) - [c35]Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
On the Combination of Argumentation Solvers into Parallel Portfolios. Australasian Conference on Artificial Intelligence 2017: 315-327 - 2016
- [c29]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
On the Effectiveness of Automated Configuration in Abstract Argumentation Reasoning. COMMA 2016: 199-206 - [c28]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems. COMMA 2016: 207-218 - [c27]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
Efficient and Off-The-Shelf Solver: jArgSemSAT. COMMA 2016: 465-466 - [c26]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati:
Generating Structured Argumentation Frameworks: AFBenchGen2. COMMA 2016: 467-468 - [c25]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation. ECAI 2016: 966-973 - [c24]Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
jArgSemSAT: An Efficient Off-the-Shelf Solver for Abstract Argumentation Frameworks. KR 2016: 541-544 - [i6]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation. CoRR abs/1612.07589 (2016) - 2015
- [c22]Federico Cerutti, Ilias Tachmazidis, Mauro Vallati, Sotirios Batsakis, Massimiliano Giacomin, Grigoris Antoniou:
Exploiting Parallelism for Hard Problems in Abstract Argumentation. AAAI 2015: 1475-1481 - 2014
- [j3]Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert W. N. van der Torre, Serena Villata:
On the Input/Output behavior of argumentation frameworks. Artif. Intell. 217: 144-197 (2014) - [c18]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati:
Algorithm Selection for Preferred Extensions Enumeration. COMMA 2014: 221-232 - [c17]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati:
ArgSemSAT: Solving Argumentation Problems Using SAT. COMMA 2014: 455-456 - [c16]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati:
Generating Challenging Benchmark AFs. COMMA 2014: 457-458 - [c12]Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Argumentation Frameworks Features: an Initial Study. ECAI 2014: 1117-1118 - [c11]Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Argumentation Extensions Enumeration as a Constraint Satisfaction Problem: a Performance Overview. DARe@ECAI 2014 - [c10]Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Marina Zanella:
An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation. KR 2014 - [i5]Federico Cerutti, Ilias Tachmazidis, Mauro Vallati, Sotiris Batsakis, Massimiliano Giacomin, Grigoris Antoniou:
Exploiting Parallelism for Hard Problems in Abstract Argumentation: Technical Report. CoRR abs/1411.2800 (2014) - 2013
- [j2]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Automata for infinite argumentation structures. Artif. Intell. 203: 104-150 (2013) - [c6]Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati:
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. TAFA 2013: 176-193 - [i3]Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati:
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach. CoRR abs/1310.4986 (2013) - 2012
- [c5]Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert W. N. van der Torre, Serena Villata:
On Input/Output Argumentation Frameworks. COMMA 2012: 358-365 - 2011
- [j1]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Giovanni Guida:
AFRA: Argumentation framework with recursive attacks. Int. J. Approx. Reason. 52(1): 19-37 (2011) - [c3]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Computing with Infinite Argumentation Frameworks: The Case of AFRAs. TAFA 2011: 197-214 - 2010
- [e1]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo Ricardo Simari:
Computational Models of Argument: Proceedings of COMMA 2010, Desenzano del Garda, Italy, September 8-10, 2010. Frontiers in Artificial Intelligence and Applications 216, IOS Press 2010, ISBN 978-1-60750-618-8 [contents] - 2009
- [c2]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Giovanni Guida:
An Argumentation-Based Approach to Modeling Decision Support Contexts with What-If Capabilities. AAAI Fall Symposium: The Uses of Computational Argumentation 2009 - [c1]Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Giovanni Guida:
Encompassing Attacks to Attacks in Abstract Argumentation Frameworks. ECSQARU 2009: 83-94
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-30 19:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
