Enrico Malizia : Publications
Journal papers
-
[1]
Explanations for Query Answers under Existential Rules
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavičius
In Artificial Intelligence. 2024.
Conditionally accepted for publication
Details about Explanations for Query Answers under Existential Rules | BibTeX data for Explanations for Query Answers under Existential Rules
-
[2]
Inconsistency−Tolerant Query Answering for Existential Rules
Thomas Lukasiewicz‚ Enrico Malizia‚ Maria Vanina Martinez‚ Cristian Molinaro‚ Andreas Pieris and Gerardo I. Simari
In Artificial Intelligence. Vol. 307. Pages 103685. June, 2022.
Details about Inconsistency−Tolerant Query Answering for Existential Rules | BibTeX data for Inconsistency−Tolerant Query Answering for Existential Rules | Link to Inconsistency−Tolerant Query Answering for Existential Rules
-
[3]
Complexity Results for Preference Aggregation over (m)CP−Nets: Max and Rank Voting
Thomas Lukasiewicz and Enrico Malizia
In Artificial Intelligence. Vol. 303. Pages 103636. February, 2022.
Details about Complexity Results for Preference Aggregation over (m)CP−Nets: Max and Rank Voting | BibTeX data for Complexity Results for Preference Aggregation over (m)CP−Nets: Max and Rank Voting | Link to Complexity Results for Preference Aggregation over (m)CP−Nets: Max and Rank Voting
-
[4]
Complexity Results for Preference Aggregation over (m)CP−nets: Pareto and Majority Voting
Thomas Lukasiewicz and Enrico Malizia
In Artificial Intelligence. Vol. 272. Pages 101–142. July, 2019.
Details about Complexity Results for Preference Aggregation over (m)CP−nets: Pareto and Majority Voting | BibTeX data for Complexity Results for Preference Aggregation over (m)CP−nets: Pareto and Majority Voting | Link to Complexity Results for Preference Aggregation over (m)CP−nets: Pareto and Majority Voting
-
[5]
A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison
Thomas Lukasiewicz and Enrico Malizia
In Theoretical Computer Science. Vol. 694. Pages 21–33. September, 2017.
Details about A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison | BibTeX data for A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison | Link to A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison
-
[6]
The Complexity of the Nucleolus in Compact Games
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In ACM Transactions on Computation Theory. Vol. 7. No. 1. Pages 3:1–3:52. December, 2014.
Details about The Complexity of the Nucleolus in Compact Games | BibTeX data for The Complexity of the Nucleolus in Compact Games | Link to The Complexity of the Nucleolus in Compact Games
-
[7]
On the complexity of core‚ kernel‚ and bargaining set
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Artificial Intelligence. Vol. 175. No. 12–13. Pages 1877–1910. August, 2011.
Details about On the complexity of core‚ kernel‚ and bargaining set | BibTeX data for On the complexity of core‚ kernel‚ and bargaining set | Link to On the complexity of core‚ kernel‚ and bargaining set
-
[8]
Non−Transferable Utility Coalitional Games via Mixed−Integer Linear Constraints
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Journal of Artificial Intelligence Research. Vol. 38. Pages 633–685. August, 2010.
Details about Non−Transferable Utility Coalitional Games via Mixed−Integer Linear Constraints | BibTeX data for Non−Transferable Utility Coalitional Games via Mixed−Integer Linear Constraints | Link to Non−Transferable Utility Coalitional Games via Mixed−Integer Linear Constraints
Conference papers
-
[1]
Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Preferred Repairs
Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro
In Pierre Marquis and Tran Cao Son, editors, Proceedings of 20th International Conference on Principles of Knowledge Representation and Reasoning‚ KR 2023‚ Rhodes‚ Greece‚ September 2−8‚ 2023. AAAI Press. September, 2023.
Details about Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Preferred Repairs | BibTeX data for Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Preferred Repairs
-
[2]
Query Answer Explanations under Existential Rules
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavicius
In Giuseppe Amato‚ Valentina Bartalesi‚ Devis Bianchini‚ Claudio Gennaro and Riccardo Torlone, editors, Proceedings of the 30th Italian Symposium on Advanced Database Systems‚ SEBD 2022‚ Tirrenia (PI)‚ Italy‚ June 19−22‚ 2022. Vol. 3194 of CEUR Workshop Proceedings. Pages 481–488. CEUR−WS.org. 2022.
Details about Query Answer Explanations under Existential Rules | BibTeX data for Query Answer Explanations under Existential Rules | Download (pdf) of Query Answer Explanations under Existential Rules
-
[3]
Explanations for Inconsistency−Tolerant Query Answering under Existential Rules
Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro
In Giuseppe Amato‚ Valentina Bartalesi‚ Devis Bianchini‚ Claudio Gennaro and Riccardo Torlone, editors, Proceedings of the 30th Italian Symposium on Advanced Database Systems‚ SEBD 2022‚ Tirrenia (PI)‚ Italy‚ June 19−22‚ 2022. Vol. 3194 of CEUR Workshop Proceedings. Pages 489–496. CEUR−WS.org. 2022.
Details about Explanations for Inconsistency−Tolerant Query Answering under Existential Rules | BibTeX data for Explanations for Inconsistency−Tolerant Query Answering under Existential Rules | Download (pdf) of Explanations for Inconsistency−Tolerant Query Answering under Existential Rules
-
[4]
Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Cardinality−Based Repairs
Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavicius
In Giuseppe Amato‚ Valentina Bartalesi‚ Devis Bianchini‚ Claudio Gennaro and Riccardo Torlone, editors, Proceedings of the 30th Italian Symposium on Advanced Database Systems‚ SEBD 2022‚ Tirrenia (PI)‚ Italy‚ June 19−22‚ 2022. Vol. 3194 of CEUR Workshop Proceedings. Pages 530–537. CEUR−WS.org. 2022.
Details about Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Cardinality−Based Repairs | BibTeX data for Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Cardinality−Based Repairs | Download (pdf) of Complexity of Inconsistency−Tolerant Query Answering in Datalog+/ under Cardinality−Based Repairs
-
[5]
Explanations for Negative Query Answers under Inconsistency−Tolerant Semantics
Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro
In Luc De Raedt, editor, Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence‚ IJCAI−ECAI 2022‚ Vienna‚ Austria‚ July 23−29‚ 2022. Pages 2705–2711. IJCAI/AAAI Press. July, 2022.
Details about Explanations for Negative Query Answers under Inconsistency−Tolerant Semantics | BibTeX data for Explanations for Negative Query Answers under Inconsistency−Tolerant Semantics | Link to Explanations for Negative Query Answers under Inconsistency−Tolerant Semantics
-
[6]
Preferred Explanations for Ontology−Mediated Queries under Existential Rules
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia‚ Cristian Molinaro and Andrius Vaicenavičius
In Kevin Leyton−Brown and Mausam, editors, Proceedings of the 35th AAAI Conference on Artificial Intelligence‚ AAAI 2021‚ Virtual Conference‚ February 2–9‚ 2021. AAAI Press. 2021.
Details about Preferred Explanations for Ontology−Mediated Queries under Existential Rules | BibTeX data for Preferred Explanations for Ontology−Mediated Queries under Existential Rules | Link to Preferred Explanations for Ontology−Mediated Queries under Existential Rules
-
[7]
Explanations for Ontology−Mediated Query Answering in Description Logics (Extended Abstract)
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavicius
In Stefan Borgwardt and Thomas Meyer, editors, Proceedings of the 33rd International Workshop on Description Logics‚ DL 2020‚ co−located with the 17th International Conference on Principles of Knowledge Representation and Reasoning‚ KR 2020‚ Online Event [Rhodes‚ Greece]‚ September 12–14‚ 2020. Vol. 2663 of CEUR Workshop Proceedings. CEUR−WS.org. 2020.
Details about Explanations for Ontology−Mediated Query Answering in Description Logics (Extended Abstract) | BibTeX data for Explanations for Ontology−Mediated Query Answering in Description Logics (Extended Abstract) | Download (pdf) of Explanations for Ontology−Mediated Query Answering in Description Logics (Extended Abstract)
-
[8]
Explanations for Negative Query Answers under Existential Rules
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia‚ Cristian Molinaro and Andrius Vaicenavičius
In Diego Calvanese and Esra Erdem, editors, Proceedings of 17th International Conference on Principles of Knowledge Representation and Reasoning‚ KR 2020‚ Rhodes‚ Greece‚ September 12−18‚ 2020. AAAI Press. September, 2020.
Details about Explanations for Negative Query Answers under Existential Rules | BibTeX data for Explanations for Negative Query Answers under Existential Rules | Link to Explanations for Negative Query Answers under Existential Rules
-
[9]
Explanations for Ontology−Mediated Query Answering in Description Logics
İsmail İlkan Ceylan‚ Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavičius
In Giuseppe De Giacomo, editor, Proceedings of the 24th European Conference on Artificial Intelligence‚ ECAI 2020‚ Santiago de Compostela‚ Spain‚ June 8–12‚ 2020. IOS Press. June, 2020.
Details about Explanations for Ontology−Mediated Query Answering in Description Logics | BibTeX data for Explanations for Ontology−Mediated Query Answering in Description Logics | Link to Explanations for Ontology−Mediated Query Answering in Description Logics
-
[10]
Explanations for Inconsistency−Tolerant Query Answering under Existential Rules
Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro
In Vincent Conitzer and Fei Sha, editors, Proceedings of the 34th National Conference on Artificial Intelligence‚ AAAI 2020‚ New York‚ New York‚ USA‚ February 7–12‚ 2020. AAAI Press. February, 2020.
Details about Explanations for Inconsistency−Tolerant Query Answering under Existential Rules | BibTeX data for Explanations for Inconsistency−Tolerant Query Answering under Existential Rules | Link to Explanations for Inconsistency−Tolerant Query Answering under Existential Rules
-
[11]
Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄− under Cardinality−Based Repairs
Thomas Lukasiewicz‚ Enrico Malizia and Andrius Vaicenavičius
In Pascal Van Hentenryck and Zhi−Hua Zhou, editors, Proceedings of the 33rd National Conference on Artificial Intelligence‚ AAAI 2019‚ Honolulu‚ Hawaii‚ USA‚ January 27 − February 1‚ 2019. Pages 2962–2969. AAAI Press. January, 2019.
Details about Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄− under Cardinality−Based Repairs | BibTeX data for Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄− under Cardinality−Based Repairs | Link to Complexity of Inconsistency−Tolerant Query Answering in Datalog+⁄− under Cardinality−Based Repairs
-
[12]
Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄−
Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro
In Jérôme Lang, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence‚ IJCAI−ECAI 2018‚ Stockholm‚ Sweden‚ July 13−19‚ 2018. Pages 1921−1927. IJCAI/AAAI Press. July, 2018.
Details about Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄− | BibTeX data for Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄− | Link to Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄−
-
[13]
On the Complexity of mCP−Nets
Thomas Lukasiewicz and Enrico Malizia
In Dale Schuurmans and Michael Wellman, editors, Proceedings of the 30th National Conference on Artificial Intelligence‚ AAAI 2016‚ Phoenix‚ Arizona‚ USA‚ February 12–17‚ 2016. Pages 558−564. AAAI Press. February, 2016.
Details about On the Complexity of mCP−Nets | BibTeX data for On the Complexity of mCP−Nets | Link to On the Complexity of mCP−Nets
-
[14]
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Georg Gottlob and Enrico Malizia
In Thomas A. Henzinger and Dale Miller, editors, Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (CSL−LICS 2014). Pages 43:1–43:10. Vienna‚ Austria. July, 2014.
Details about Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | BibTeX data for Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | Link to Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
-
[15]
How much navigable is the Web of Linked Data?
Valeria Fionda and Enrico Malizia
In Matthew Horridge‚ Marco Rospocher and Jacco van Ossenbruggen, editors, Proceedings of the ISWC 2014 Posters & Demonstrations. A track of the 13th International Semantic Web Conference (ISWC 2014). Vol. 1272 of CEUR Workshop Proceedings (CEUR−WS.org). Pages 317–320. Riva del Garda‚ Italy. October, 2014.
Details about How much navigable is the Web of Linked Data? | BibTeX data for How much navigable is the Web of Linked Data? | Download (pdf) of How much navigable is the Web of Linked Data?
-
[16]
Hard and Easy k−Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary
Gianluigi Greco‚ Enrico Malizia‚ Francesco Scarcello and Luigi Palopoli
In Luc De Raedt‚ Christian Bessière‚ Didier Dubois‚ Patrick Doherty‚ Paolo Frasconi‚ Fredrik Heintz and Peter J. F. Lucas, editors, Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). Pages 372–377. Montpellier‚ France. August, 2012.
Details about Hard and Easy k−Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary | BibTeX data for Hard and Easy k−Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary | Link to Hard and Easy k−Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary
-
[17]
Subsidies‚ Stability‚ and Restricted Cooperation in Coalitional Games
Reshef Meir‚ Jeffrey S. Rosenschein and Enrico Malizia
In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI−11). Pages 301–306. Barcelona‚ Spain. July, 2011.
Details about Subsidies‚ Stability‚ and Restricted Cooperation in Coalitional Games | BibTeX data for Subsidies‚ Stability‚ and Restricted Cooperation in Coalitional Games | Download (pdf) of Subsidies‚ Stability‚ and Restricted Cooperation in Coalitional Games
-
[18]
On The Complexity of the Core over Coalition Structures
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI−11). Pages 216–221. Barcelona‚ Spain. July, 2011.
Details about On The Complexity of the Core over Coalition Structures | BibTeX data for On The Complexity of the Core over Coalition Structures | Download (pdf) of On The Complexity of the Core over Coalition Structures
-
[19]
Constrained coalitional games: formal framework‚ properties‚ and complexity results (Extended Abstract)
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Carles Sierra‚ Cristiano Castelfranchi‚ Keith S. Decker and Jaime Simão Sichman, editors, Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009). Pages 1295–1296. Budapest‚ Hungary. May, 2009.
Details about Constrained coalitional games: formal framework‚ properties‚ and complexity results (Extended Abstract) | BibTeX data for Constrained coalitional games: formal framework‚ properties‚ and complexity results (Extended Abstract) | Link to Constrained coalitional games: formal framework‚ properties‚ and complexity results (Extended Abstract)
-
[20]
On the Complexity of Compact Coalitional Games
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Craig Boutilier, editor, Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI−09). Pages 147–152. Pasadena‚ CA‚ USA. July, 2009.
Details about On the Complexity of Compact Coalitional Games | BibTeX data for On the Complexity of Compact Coalitional Games | Download (pdf) of On the Complexity of Compact Coalitional Games
-
[21]
Infeasibility Certificates and the Complexity of the Core in Coalitional Games
Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
In Manuela M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI−07). Pages 1402–1407. Hyderabad‚ India. January, 2007.
Details about Infeasibility Certificates and the Complexity of the Core in Coalitional Games | BibTeX data for Infeasibility Certificates and the Complexity of the Core in Coalitional Games | Download (pdf) of Infeasibility Certificates and the Complexity of the Core in Coalitional Games
Technical reports
-
[1]
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Georg Gottlob and Enrico Malizia
No. arXiv:1407.2912. Computing Research Repository (CoRR). June, 2015.
Details about Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | BibTeX data for Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic | Link to Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
-
[2]
On the Complexity of Core‚ Kernel‚ and Bargaining Set
Gianluigi Greco‚ Enrico Malizia‚ Luigi Palopoli and Francesco Scarcello
No. arXiv:0810.3136. Computing Research Repository (CoRR). September, 2010.
Details about On the Complexity of Core‚ Kernel‚ and Bargaining Set | BibTeX data for On the Complexity of Core‚ Kernel‚ and Bargaining Set | Link to On the Complexity of Core‚ Kernel‚ and Bargaining Set