| 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 | 53 | 2011 |
| 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 | 51 | 2011 |
| Subsidies, stability, and restricted cooperation in coalitional games R Meir, JS Rosenschein, E Malizia IJCAI 11, 301-306, 2011 | 42 | 2011 |
| 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 | 34 | 2014 |
| Explanations for negative query answers under existential rules I Ceylan, T Lukasiewicz, E Malizia, C Molinaro, A Vaicenavicius IJCAI Organization, 2020 | 33 | 2020 |
| On the Complexity of Compact Coalitional Games. G Greco, E Malizia, L Palopoli, F Scarcello IJCAI 9, 147-152, 2009 | 29 | 2009 |
| Explanations for query answers under existential rules II Ceylan, T Lukasiewicz, A Vaicenavičius | 28 | 2019 |
| 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 | 26 | 2018 |
| 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 | 26 | 2015 |
| Infeasibility Certificates and the Complexity of the Core in Coalitional Games. E Malizia, L Palopoli, F Scarcello IJCAI, 1402-1407, 2007 | 26 | 2007 |
| 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 | 24 | 2010 |
| Materializing knowledge bases via trigger graphs E Tsamoura, D Carral, E Malizia, J Urbani arXiv preprint arXiv:2102.02753, 2021 | 23 | 2021 |
| 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 | 22 | 2019 |
| Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting T Lukasiewicz, E Malizia arXiv preprint arXiv:1806.10018, 2018 | 22 | 2018 |
| Explanations for ontology-mediated query answering in description logics II Ceylan, T Lukasiewicz, E Malizia, A Vaicenavičius ECAI 2020, 672-679, 2020 | 21 | 2020 |
| A novel characterization of the complexity class ΘkP based on counting and comparison T Lukasiewicz, E Malizia Theoretical Computer Science 694, 21-33, 2017 | 19 | 2017 |
| On the complexity of mCP-nets T Lukasiewicz, E Malizia Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 19 | 2016 |
| Inconsistency-tolerant query answering for existential rules T Lukasiewicz, E Malizia, MV Martinez, C Molinaro, A Pieris, GI Simari Artificial Intelligence 307, 103685, 2022 | 18 | 2022 |
| 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 | 18 | 2020 |
| 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 | 14 | 2021 |
Thomas LukasiewiczVienna University of Technology, Austria; University of Oxford, UK在 tuwien.ac.at 的电子邮件经过验证
