default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnrico Malizia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j11]Thomas Lukasiewicz, Enrico Malizia
:
Complexity results for preference aggregation over (m)CP-nets: Max and rank voting. Artif. Intell. 303: 103636 (2022)- [j10]Thomas Lukasiewicz, Enrico Malizia, Maria Vanina Martinez, Cristian Molinaro, Andreas Pieris, Gerardo I. Simari:
Inconsistency-tolerant query answering for existential rules. Artif. Intell. 307: 103685 (2022) - [j9]Enrico Malizia, Cristian Molinaro, Francesco Parisi:
Guest Editorial: Reasoning With Inconsistent, Incomplete, and Uncertain Knowledge. IEEE Intell. Syst. 37(6): 13-17 (2022) - 2021
- [j8]Efthymia Tsamoura, David Carral, Enrico Malizia, Jacopo Urbani:
Materializing Knowledge Bases via Trigger Graphs. Proc. VLDB Endow. 14(6): 943-956 (2021) - 2019
- [j7]Thomas Lukasiewicz, Enrico Malizia:
Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting. Artif. Intell. 272: 101-142 (2019) - 2018
- [j6]Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman:
Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. 63: 987-1023 (2018) - [j5]Georg Gottlob, Enrico Malizia:
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic. SIAM J. Comput. 47(2): 456-492 (2018) - 2017
- [j4]Thomas Lukasiewicz, Enrico Malizia:
A novel characterization of the complexity class ϴPk based on counting and comparison. Theor. Comput. Sci. 694: 21-33 (2017) - 2014
- [j3]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
The Complexity of the Nucleolus in Compact Games. ACM Trans. Comput. Theory 7(1): 3:1-3:52 (2014) - 2011
- [j2]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the complexity of core, kernel, and bargaining set. Artif. Intell. 175(12-13): 1877-1910 (2011) - 2010
- [j1]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints. J. Artif. Intell. Res. 38: 633-685 (2010)
Conference and Workshop Papers
- 2023
- [c26]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Preferred Repairs. KR 2023: 472-481 - 2022
- [c25]Thomas Lukasiewicz, Enrico Malizia:
Pareto and Majority Voting in mCP-nets. DP@AI*IA 2022: 23-31 - [c24]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavicius:
Explanations for Negative Query Answers under Existential Rules. DP@AI*IA 2022: 65-74 - [c23]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Explanations for Negative Query Answers under Inconsistency-Tolerant Semantics. IJCAI 2022: 2705-2711 - [c22]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Query Answer Explanations under Existential Rules. SEBD 2022: 481-488 - [c21]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Explanations for Inconsistency-Tolerant Query Answering under Existential Rules. SEBD 2022: 489-496 - [c20]Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs. SEBD 2022: 530-537 - 2021
- [c19]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavicius:
Preferred Explanations for Ontology-Mediated Queries under Existential Rules. AAAI 2021: 6262-6270 - 2020
- [c18]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Explanations for Inconsistency-Tolerant Query Answering under Existential Rules. AAAI 2020: 2909-2916 - [c17]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Explanations for Ontology-Mediated Query Answering in Description Logics (Extended Abstract). Description Logics 2020 - [c16]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Explanations for Ontology-Mediated Query Answering in Description Logics. ECAI 2020: 672-679 - [c15]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavicius:
Explanations for Negative Query Answers under Existential Rules. KR 2020: 223-232 - 2019
- [c14]Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs. AAAI 2019: 2962-2969 - [c13]Ismail Ilkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavicius:
Explanations for Query Answers under Existential Rules. IJCAI 2019: 1639-1646 - 2018
- [c12]Enrico Malizia:
More Complexity Results about Reasoning over ( m )CP-nets. AAMAS 2018: 1540-1548 - [c11]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Complexity of Approximate Query Answering under Inconsistency in Datalog+/-. IJCAI 2018: 1921-1927 - [c10]Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro:
Complexity of Approximate Query Answering under Inconsistency in Datalog+/-. SEBD 2018 - 2016
- [c9]Thomas Lukasiewicz, Enrico Malizia:
On the Complexity of mCP-nets. AAAI 2016: 558-564 - 2014
- [c8]Georg Gottlob, Enrico Malizia:
Achieving new upper bounds for the hypergraph duality problem through logic. CSL-LICS 2014: 43:1-43:10 - [c7]Valeria Fionda, Enrico Malizia:
How much navigable is the Web of Linked Data? ISWC (Posters & Demos) 2014: 317-320 - 2012
- [c6]Gianluigi Greco, Enrico Malizia, Francesco Scarcello, Luigi Palopoli:
Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary. ECAI 2012: 372-377 - 2011
- [c5]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of the Core over Coalition Structures. IJCAI 2011: 216-221 - [c4]Reshef Meir, Jeffrey S. Rosenschein, Enrico Malizia:
Subsidies, Stability, and Restricted Cooperation in Coalitional Games. IJCAI 2011: 301-306 - 2009
- [c3]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Constrained coalitional games: formal framework, properties, and complexity results. AAMAS (2) 2009: 1295-1296 - [c2]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of Compact Coalitional Games. IJCAI 2009: 147-152 - 2007
- [c1]Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Infeasibility Certificates and the Complexity of the Core in Coalitional Games. IJCAI 2007: 1402-1407
Informal and Other Publications
- 2024
- [i6]Enrico Malizia:
Hausdorff Reductions and the Exponential Hierarchies. CoRR abs/2402.00791 (2024) - 2021
- [i5]Efthymia Tsamoura, David Carral, Enrico Malizia, Jacopo Urbani:
Materializing Knowledge Bases via Trigger Graphs. CoRR abs/2102.02753 (2021) - 2018
- [i4]Thomas Lukasiewicz, Enrico Malizia:
Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting. CoRR abs/1806.10018 (2018) - 2014
- [i3]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints. CoRR abs/1401.3852 (2014) - [i2]Georg Gottlob, Enrico Malizia:
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic. CoRR abs/1407.2912 (2014) - 2008
- [i1]Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games. CoRR abs/0810.3136 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
