Enrico Malizia

zbMATH OpenDBLPWikidataMaRDI QIDQ650524FDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Inconsistency-tolerant query answering for existential rules Artificial Intelligence	2022-04-11	Paper
Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting Artificial Intelligence	2022-03-02	Paper
scientific article; zbMATH DE number 7368419 (Why is no real title available?)	2021-07-06	Paper
Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting Artificial Intelligence	2019-08-28	Paper
Bounds on the cost of stabilizing a cooperative game Journal of Artificial Intelligence Research	2019-01-18	Paper
Achieving new upper bounds for the hypergraph duality problem through logic SIAM Journal on Computing	2018-04-26	Paper
Achieving new upper bounds for the hypergraph duality problem through logic 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)	2018-04-23	Paper
A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison Theoretical Computer Science	2017-09-12	Paper
The complexity of the nucleolus in compact games ACM Transactions on Computation Theory	2016-10-24	Paper
Hard and easy \(k\)-typed compact coalitional games: the knowledge of player types marks the boundary	2015-12-11	Paper
On the complexity of core, kernel, and bargaining set Artificial Intelligence	2011-11-25	Paper
Non-transferable utility coalitional games via mixed-integer linear constraints Journal of Artificial Intelligence Research	2010-09-09	Paper

Research outcomes over time

This page was built for person: Enrico Malizia