12 April 2018 | Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
| Gottlob, G; Malizia, E |
12 April 2018 | Achieving new upper bounds for the hypergraph duality problem through logic
| Gottlob, G; Malizia, E |
27 December 2018 | Bounds on the Cost of Stabilizing a Cooperative Game
| Bachrach, YB; Elkind, E; Malizia, E; et al. |
1 July 2018 | Complexity of Approximate Query Answering under Inconsistency in Datalog+/-
| Lukasiewicz, T; Malizia, E; Molinaro, C |
1 June 2018 | Complexity of Approximate Query Answering under Inconsistency in Datalog+/-
| Lukasiewicz, T; Malizia, E; Molinaro, C |
17 July 2019 | Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs
| Lukasiewicz, T; Malizia, E; Vaicenavicius, A |
1 December 2014 | The complexity of the nucleolus in compact games
| Greco, G; Malizia, E; Palopoli, L; et al. |
31 January 2019 | Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting
| Lukasiewicz, T; Malizia, E |
16 August 2019 | Explanations for Query Answers under Existential Rules
| Ceylan, II; Lukasiewicz, T; Malizia, E; et al. |
1 July 2018 | More complexity results about reasoning over (m)CP-nets
| Malizia, E |
8 July 2017 | A novel characterization of the complexity class based on counting and comparison
| Lukasiewicz, T; Malizia, E |
1 February 2016 | On the complexity of mCP-nets
| Malizia, E; Lukasiewicz, T |