Michael Benedikt : Publications
-
[1]
Almost Surely Asymptotically Constant Graph Neural Networks
Sam Adam−Day‚ Michael Benedikt‚ İsmail İlkan Ceylan and Ben Finkelshtein
In Proceedings of the 38th Annual Conference on Neural Information Processing Systems (NeurIPS). 2024.
Details about Almost Surely Asymptotically Constant Graph Neural Networks | BibTeX data for Almost Surely Asymptotically Constant Graph Neural Networks | Link to Almost Surely Asymptotically Constant Graph Neural Networks
-
[2]
Logical foundations of information disclosure in ontology−based data integration
Michael Benedikt‚ Bernardo Cuenca Grau and Egor V. Kostylev
In Artificial Intelligence. Vol. 262. Pages 52–95. 2018.
Details about Logical foundations of information disclosure in ontology−based data integration | BibTeX data for Logical foundations of information disclosure in ontology−based data integration | DOI (10.1016/j.artint.2018.06.002)
-
[3]
Goal−Driven Query Answering for Existential Rules With Equality
Michael Benedikt‚ Boris Motik and Efthymia Tsamoura
In Proceedings of the Thirty−Second AAAI Conference on Artificial Intelligence‚ New Orleans‚ Louisiana‚ USA‚ February 2−7‚ 2018. 2018.
Details about Goal−Driven Query Answering for Existential Rules With Equality | BibTeX data for Goal−Driven Query Answering for Existential Rules With Equality | Link to Goal−Driven Query Answering for Existential Rules With Equality
-
[4]
Reformulating Queries: Theory and Practice
Michael Benedikt‚ Egor V. Kostylev‚ Fabio Mogavero and Efthymia Tsamoura
In Carles Sierra, editor, Proceedings of the Twenty−Sixth International Joint Conference on Artificial Intelligence‚ IJCAI 2017‚ Melbourne‚ Australia‚ August 19−25‚ 2017. Pages 837–843. ijcai.org. 2017.
Details about Reformulating Queries: Theory and Practice | BibTeX data for Reformulating Queries: Theory and Practice | DOI (10.24963/ijcai.2017/116) | Link to Reformulating Queries: Theory and Practice
-
[5]
Positive Higher−Order Queries
Michael Benedikt‚ Gabriele Puppis and Huy Vu
In PODS: The 29th ACM SIGMOD−SIGACT−SIGART Symposium on Principles of Database Systems. 2010.
Details about Positive Higher−Order Queries | BibTeX data for Positive Higher−Order Queries | Download (pdf) of Positive Higher−Order Queries
-
[6]
How Big Must Complete XML Query Languages Be?
Clemens Ley and Michael Benedikt
2009.
Details about How Big Must Complete XML Query Languages Be? | BibTeX data for How Big Must Complete XML Query Languages Be? | Download (pdf) of How Big Must Complete XML Query Languages Be?