Seguir
Enrico Malizia
Enrico Malizia
Associate Professor -- DISI, University of Bologna, Italy
Dirección de correo verificada de unibo.it - Página principal
Título
Citado por
Citado por
Año
On the complexity of core, kernel, and bargaining set
G Greco, E Malizia, L Palopoli, F Scarcello
Artificial Intelligence 175 (12-13), 1877-1910, 2011
532011
On the complexity of the core over coalition structures
G Greco, E Malizia, L Palopoli, F Scarcello
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
512011
Subsidies, stability, and restricted cooperation in coalitional games
R Meir, JS Rosenschein, E Malizia
IJCAI 11, 301-306, 2011
422011
Achieving new upper bounds for the hypergraph duality problem through logic
G Gottlob, E Malizia
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
342014
Explanations for negative query answers under existential rules
I Ceylan, T Lukasiewicz, E Malizia, C Molinaro, A Vaicenavicius
IJCAI Organization, 2020
332020
On the Complexity of Compact Coalitional Games.
G Greco, E Malizia, L Palopoli, F Scarcello
IJCAI 9, 147-152, 2009
292009
Explanations for query answers under existential rules
II Ceylan, T Lukasiewicz, A Vaicenavičius
272019
Complexity of approximate query answering under inconsistency in datalog+/-
T Lukasiewicz, E Malizia, C Molinaro
27th International Joint Conference on Artificial Intelligence and the 23rd …, 2018
262018
Infeasibility Certificates and the Complexity of the Core in Coalitional Games.
E Malizia, L Palopoli, F Scarcello
IJCAI, 1402-1407, 2007
262007
The complexity of the nucleolus in compact games
G Greco, E Malizia, L Palopoli, F Scarcello
ACM Transactions on Computation Theory (TOCT) 7 (1), 1-52, 2015
252015
Non-transferable utility coalitional games via mixed-integer linear constraints
G Greco, E Malizia, L Palopoli, F Scarcello
Journal of Artificial Intelligence Research 38, 633-685, 2010
242010
Materializing knowledge bases via trigger graphs
E Tsamoura, D Carral, E Malizia, J Urbani
arXiv preprint arXiv:2102.02753, 2021
222021
Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting
T Lukasiewicz, E Malizia
arXiv preprint arXiv:1806.10018, 2018
222018
Complexity of inconsistency-tolerant query answering in Datalog+/–under cardinality-based repairs
T Lukasiewicz, E Malizia, A Vaicenavičius
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2962-2969, 2019
212019
Explanations for ontology-mediated query answering in description logics
II Ceylan, T Lukasiewicz, E Malizia, A Vaicenavičius
ECAI 2020, 672-679, 2020
202020
A novel characterization of the complexity class ΘkP based on counting and comparison
T Lukasiewicz, E Malizia
Theoretical Computer Science 694, 21-33, 2017
192017
On the complexity of mCP-nets
T Lukasiewicz, E Malizia
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
192016
Explanations for inconsistency-tolerant query answering under existential rules
T Lukasiewicz, E Malizia, C Molinaro
Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2909-2916, 2020
182020
Inconsistency-tolerant query answering for existential rules
T Lukasiewicz, E Malizia, MV Martinez, C Molinaro, A Pieris, GI Simari
Artificial Intelligence 307, 103685, 2022
172022
Preferred explanations for ontology-mediated queries under existential rules
II Ceylan, T Lukasiewicz, E Malizia, C Molinaro, A Vaicenavičius
Proceedings of the AAAI Conference on Artificial Intelligence 35 (7), 6262-6270, 2021
142021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20