Enrico Malizia

Orcid: 0000-0002-6780-4711

According to our database1, Enrico Malizia authored at least 35 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hausdorff Reductions and the Exponential Hierarchies.
CoRR, 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
Guest Editorial: Reasoning With Inconsistent, Incomplete, and Uncertain Knowledge.
IEEE Intell. Syst., 2022

Inconsistency-tolerant query answering for existential rules.
Artif. Intell., 2022

Complexity results for preference aggregation over (<i>m</i>)CP-nets: Max and rank voting.
Artif. Intell., 2022

Query Answer Explanations under Existential Rules.
Proceedings of the 30th Italian Symposium on Advanced Database Systems, 2022

Explanations for Negative Query Answers under Inconsistency-Tolerant Semantics.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Pareto and Majority Voting in mCP-nets.
Proceedings of the Discussion Papers - 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2022 DP), Udine, Italy, November 28, 2022

2021
Materializing Knowledge Bases via Trigger Graphs.
Proc. VLDB Endow., 2021

Preferred Explanations for Ontology-Mediated Queries under Existential Rules.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Explanations for Negative Query Answers under Existential Rules.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Explanations for Ontology-Mediated Query Answering in Description Logics.
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

Explanations for Inconsistency-Tolerant Query Answering under Existential Rules.
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

Explanations for Query Answers under Existential Rules.
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
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic.
SIAM J. Comput., 2018

Bounds on the Cost of Stabilizing a Cooperative Game.
J. Artif. Intell. Res., 2018

Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting.
CoRR, 2018

Complexity of Approximate Query Answering under Inconsistency in Datalog+/-.
Proceedings of the 26th Italian Symposium on Advanced Database Systems, 2018

More Complexity Results about Reasoning over ( m )CP-nets.
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
On the Complexity of mCP-nets.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2014
The Complexity of the Nucleolus in Compact Games.
ACM Trans. Comput. Theory, 2014

How much navigable is the Web of Linked Data?
Proceedings of the ISWC 2014 Posters & Demonstrations Track a track within the 13th International Semantic Web Conference, 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
On the complexity of core, kernel, and bargaining set.
Artif. Intell., 2011

Subsidies, Stability, and Restricted Cooperation in Coalitional Games.
Proceedings of the IJCAI 2011, 2011

On the Complexity of the Core over Coalition Structures.
Proceedings of the IJCAI 2011, 2011

2010
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints.
J. Artif. Intell. Res., 2010

2009
On the Complexity of Compact Coalitional Games.
Proceedings of the IJCAI 2009, 2009

Constrained coalitional games: formal framework, properties, and complexity results.
Proceedings of the 8th International Joint 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
Infeasibility Certificates and the Complexity of the Core in Coalitional Games.
Proceedings of the IJCAI 2007, 2007


  Loading...