Bernardo Cuenca Grau

Bernardo Cuenca Grau

Auto-generated profile, based on publicly available information

Bernardo Cuenca Grau

University of Oxford

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2016 in Artificial Intelligence
Verified
Journal Article
Closed access
MKMark Kaminski
Mark Kaminski
YNYavor Nenov
Yavor Nenov
BGBernardo Cuenca Grau
Bernardo Cuenca Grau

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
PWPrzemysław Andrzej Wałęga
Przemysław Andrzej Wałęga
MKMark Kaminski
Mark Kaminski
BGBernardo Cuenca Grau
Bernardo Cuenca Grau
We study stream reasoning in datalogMTL—an extension of Datalog with metric temporal operators. We propose a sound and complete stream reasoning algorithm that is applicable to a fragment datalogMTLFP of datalogMTL, in which propagation of derived information towards past time points is precluded. Memory consumption in our algorithm depends both on the properties of the rule set and the input data stream; in particular, it depends on the distances between timestamps occurring in data. This is undesirable since these distances can be very small, in which case the algorithm may require large amounts of memory. To address this issue, we propose a second algorithm, where the size of the required memory becomes independent on the timestamps in the data at the expense of disallowing punctual intervals in the rule set. Finally, we provide tight bounds to the data complexity of standard query answering in datalogMTLFP without punctual intervals in rules, which yield a new PSPACE lower bound to the data complexity of the full datalogMTL.

1 September 2019 in Artificial Intelligence
Verified
Journal Article
Open access
CNCharalampos Nikolaou
Charalampos Nikolaou
EKEgor V. Kostylev
Egor V. Kostylev
GKGeorge Konstantinidis
George Konstantinidis
MKMark Kaminski
Mark Kaminski
BGBernardo Cuenca Grau
Bernardo Cuenca Grau
IHIan Horrocks
Ian Horrocks

22 October 2012 in Journal of Artificial Intelligence Research
Verified
Journal Article
Open access
PDF file
BGB. Cuenca Grau
B. Cuenca Grau
BMB. Motik
B. Motik
There is currently a growing interest in techniques for hiding parts of the signature of an ontology Kh that is being reused by another ontology Kv. Towards this goal, in this paper we propose the import-by-query framework, which makes the content of Kh accessible through a limited query interface. If Kv reuses the symbols from Kh in a certain restricted way, one can reason over Kv U Kh by accessing only Kv and the query interface. We map out the landscape of the import-by-query problem. In particular, we outline the limitations of our framework and prove that certain restrictions on the expressivity of Kh and the way in which Kv reuses symbols from Kh are strictly necessary to enable reasoning in our setting. We also identify cases in which reasoning is possible and we present suitable import-by-query reasoning algorithms.

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
DWDingmin Wang
Dingmin Wang
YCYeyuan Chen
Yeyuan Chen
BGBernardo Cuenca Grau
Bernardo Cuenca Grau
The problem of answering complex First-order Logic queries over incomplete knowledge graphs is receiving growing attention in the literature. A promising recent approach to this problem has been to exploit neural link predictors, which can be effective in identifying individual missing triples in the incomplete graph, in order to efficiently answer complex queries. A crucial advantage of this approach over other methods is that it does not require example answers to complex queries for training, as it relies only on the availability of a trained link predictor for the knowledge graph at hand. This approach, however, can be computationally expensive during inference, and cannot deal with queries involving negation. In this paper, we propose a novel approach that addresses all of these limitations. Experiments on established benchmark datasets demonstrate that our approach offers superior performance while significantly reducing inference times.

31 January 2022 in Artificial Intelligence
Verified
Journal Article
Closed access
ARAlessandro Ronca
Alessandro Ronca
MKMark Kaminski
Mark Kaminski
BGBernardo Cuenca Grau
Bernardo Cuenca Grau
IHIan Horrocks
Ian Horrocks