CEYLAN İSMAIL İLKAN; LUKASIEWICZ THOMAS; MALIZIA E; VAICENAVIČIUS ANDRIUS, Explanations for Ontology-Mediated Query Answering in Description Logics (Extended Abstract), in: Proceedings of the 33rd International Workshop on Description Logics (DL 2020), 2020, pp. 1 - 3 (atti di: DL 2020, Rhodes, Greece - Online, 12/09/2020 - 14/09/2020) [atti di convegno-abstract]
LUKASIEWICZ THOMAS; MALIZIA E; VAICENAVIČIUS ANDRIUS, Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs, in: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), 2019, pp. 2962 - 2969 (atti di: AAAI-19, Honolulu, Hawaii, USA, 27/01/2019 - 01/02/2019) [Contributo in Atti di convegno]
LUKASIEWICZ THOMAS; MALIZIA E, Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting, «ARTIFICIAL INTELLIGENCE», 2019, 272, pp. 101 - 142 [articolo]
CEYLAN İSMAIL İLKAN; LUKASIEWICZ THOMAS; MALIZIA E; VAICENAVIČIUS ANDRIUS, Explanations for Query Answers under Existential Rules, in: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI-19), 2019, pp. 1639 - 1646 (atti di: IJCAI-19, Macao, China, 10/08/2019 - 16/08/2019) [Contributo in Atti di convegno]
GOTTLOB GEORG; MALIZIA E, Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, «SIAM JOURNAL ON COMPUTING», 2018, 47, pp. 456 - 492 [articolo]
BACHRACH YORAM; ELKIND EDITH; MALIZIA E; MEIR RESHEF; PASECHNIK DMITRII; ROSENSCHEIN JEFFREY S.; ROTHE JÖRG; ZUCKERMAN MICHAEL, Bounds on the Cost of Stabilizing a Cooperative Game, «JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH», 2018, 63, pp. 987 - 1023 [articolo]
LUKASIEWICZ THOMAS; MALIZIA E; MOLINARO CRISTIAN, Complexity of Approximate Query Answering under Inconsistency in Datalog+/-, in: Proceedings of the 26th Italian Symposium on Advanced Database Systems (SEBD 2018), 2018, pp. 1 - 8 (atti di: SEBD 2018, Castellaneta Marina (Italy), 24/06/2018 - 27/06/2018) [Contributo in Atti di convegno]
LUKASIEWICZ THOMAS; MALIZIA E; MOLINARO CRISTIAN, Complexity of Approximate Query Answering under Inconsistency in Datalog+/-, in: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), 2018, pp. 1921 - 1927 (atti di: IJCAI-18, Stockholm, Sweden, 13/07/2018 - 19/07/2018) [Contributo in Atti di convegno]
MALIZIA E, More complexity results about reasoning over (m)CP-nets, in: Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018), 2018, pp. 1540 - 1548 (atti di: AAMAS 2018, Stockholm, Sweden, 11/07/2018 - 13/07/2018) [Contributo in Atti di convegno]
LUKASIEWICZ THOMAS; MALIZIA E, A novel characterization of the complexity class Θ^P_k based on counting and comparison, «THEORETICAL COMPUTER SCIENCE», 2017, 694, pp. 21 - 33 [articolo]
LUKASIEWICZ THOMAS; MALIZIA E, On the Complexity of mCP-nets, in: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI 2016), 2016, pp. 558 - 564 (atti di: AAAI 2016, Phoenix, Arizona, USA, 12/02/2016 - 17/02/2016) [Contributo in Atti di convegno]
GOTTLOB GEORG; MALIZIA E, Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, 2014. [rapporto tecnico]
GOTTLOB GEORG; MALIZIA E, Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, in: 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) (CSL-LICS 2014), 2014, pp. 1 - 10 (atti di: CSL-LICS '14, Vienna, Austria, 14/07/2014 - 18/07/2014) [Contributo in Atti di convegno]
Fionda Valeria; Malizia E, How much navigable is the Web of Linked Data?, in: Proceedings of the ISWC 2014 Posters & Demonstrations Track a track within the 13th International Semantic Web Conference (ISWC 2014), 2014, 1272, pp. 317 - 320 (atti di: ISWC 2014 Posters & Demonstrations Track, Riva del Garda, Italy, 21/10/2014) [atti di convegno-poster]
GRECO GIANLUIGI; MALIZIA E; PALOPOLI LUIGI; SCARCELLO FRANCESCO, The Complexity of the Nucleolus in Compact Games, «ACM TRANSACTIONS ON COMPUTATION THEORY», 2014, 7, Article number: 3, pp. 1 - 52 [articolo]
