Enrico Malizia
Orcid: 0000-0002-6780-4711
According to our database1,
Enrico Malizia
authored at least 37 papers
between 2007 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2025
CoRR, January, 2025
2024
Proceedings of the AIxIA Discussion Papers 2024 co-located with the 23rd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2024), 2024
2023
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Preferred Repairs.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023
2022
IEEE Intell. Syst., 2022
Complexity results for preference aggregation over (<i>m</i>)CP-nets: Max and rank voting.
Artif. Intell., 2022
Proceedings of the 30th Italian Symposium on Advanced Database Systems, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Discussion Papers - 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2022 DP), Udine, Italy, November 28, 2022
2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
Explanations for Ontology-Mediated Query Answering in Description Logics (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
Complexity results for preference aggregation over (<i>m</i>)CP-nets: Pareto and majority voting.
Artif. Intell., 2019
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting.
CoRR, 2018
Proceedings of the 26th Italian Symposium on Advanced Database Systems, 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
A novel characterization of the complexity class ϴ<sup>P</sup><sub>k</sub> based on counting and comparison.
Theor. Comput. Sci., 2017
2016
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
2014
Proceedings of the ISWC 2014 Posters & Demonstrations Track a track within the 13th International Semantic Web Conference, 2014
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
2012
Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary.
Proceedings of the ECAI 2012, 2012
2011
Proceedings of the IJCAI 2011, 2011
Proceedings of the IJCAI 2011, 2011
2010
J. Artif. Intell. Res., 2010
2009
Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009
2008
On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games
CoRR, 2008
2007
Proceedings of the IJCAI 2007, 2007