A novel characterization of the complexity class Θ2P based on counting and comparison by Lukasiewicz, T, Malizia, E

Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting by Lukasiewicz, T, Malizia, E

On the complexity of mCP−nets by Lukasiewicz, T, Malizia, E

Complexity results for preference aggregation over (m)CP-nets: max and rank voting by Lukasiewicz, T, Malizia, E

Achieving new upper bounds for the hypergraph duality problem through logic by Gottlob, G, Malizia, E

Achieving new upper bounds for the hypergraph duality problem through logic by Gottlob, G, Malizia, E

Explanations for inconsistency-tolerant query answering under existential rules by Lukasiewicz, T, Malizia, E, Molinaro, C

Complexity of approximate query answering under inconsistency in datalog+/- by Lukasiewicz, T, Malizia, E, Molinaro, C

Complexity of approximate query answering under inconsistency in Datalog+/- by Lukasiewicz, T, Malizia, E, Molinaro, C

Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs by Lukasiewicz, T, Malizia, E, Vaicenavičius, A

Explanations for ontology-mediated query answering in description logics by Ceylan, II, Lukasiewicz, T, Malizia, E, Vaicenavičius, A

Explanations for Query Answers under Existential Rules by Ceylan, İ, Lukasiewicz, T, Malizia, E, Vaicenavičius, A

Explanations for negative query answers under existential rules by Ceylan, I, Lukasiewicz, T, Malizia, E, Molinaro, C, Vaicenavicius, A

Preferred explanations for ontology−mediated queries under existential rules by Ceylan, II, Lukasiewicz, T, Malizia, E, Molinaro, C, Vaicenavicius, A

Bounds on the cost of stabilizing a cooperative game by Bachrach, Y, Elkind, E, Malizia, E, Meir, R, Pasechnik, D, Rosenschein, J, Rothe, J, Zuckerman, M