We introduce injective semantics for Conjunctive Regular Path Queries
(C...
The availability of genomic data has grown exponentially in the last dec...
Formal XAI (explainable AI) is a growing area that focuses on computing
...
Dynamic Parallelism (DP) is a runtime feature of the GPU programming mod...
Gene annotation addresses the problem of predicting unknown associations...
Node classification is the task of inferring or predicting missing node
...
The spectral evolution model aims to characterize the growth of large
ne...
A query Q is monotonically determined over a set of views if Q can be
ex...
The growing use of Machine Learning has produced significant advances in...
We identify a sufficient condition, treewidth-pliability, that gives a
p...
This paper addresses the issue of specifying, simulating, and verifying
...
The complexity of (unbounded-arity) Max-CSPs under structural restrictio...
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable ...
We study the boundedness problem for unions of conjunctive regular path
...
Spatial concurrent constraint programming (SCCP) is an algebraic model o...
We study the complexity of query evaluation of SPARQL queries. We focus ...
General-valued constraint satisfaction problems (VCSPs) are generalisati...