Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Nenov, Yavor"'
Materialisation facilitates Datalog reasoning by precomputing all consequences of the facts and the rules so that queries can be directly answered over the materialised facts. However, storing all materialised facts may be infeasible in practice, esp
Externí odkaz:
http://arxiv.org/abs/2312.11297
Datalog reasoning based on the semina\"ive evaluation strategy evaluates rules using traditional join plans, which often leads to redundancy and inefficiency in practice, especially when the rules are complex. Hypertree decompositions help identify e
Externí odkaz:
http://arxiv.org/abs/2305.06854
Autor:
Bellomarini, Luigi, Fayzrakhmanov, Ruslan R., Gottlob, Georg, Kravchenko, Andrey, Laurenza, Eleonora, Nenov, Yavor, Reissfelder, Stephane, Sallinger, Emanuel, Sherkhonov, Evgeny, Wu, Lianlong
Following the recent successful examples of large technology companies, many modern enterprises seek to build knowledge graphs to provide a unified view of corporate knowledge and to draw deep insights using machine learning and logical reasoning. Th
Externí odkaz:
http://arxiv.org/abs/1807.08712
Autor:
Bellomarini, Luigi, Fayzrakhmanov, Ruslan R., Gottlob, Georg, Kravchenko, Andrey, Laurenza, Eleonora, Nenov, Yavor, Reissfelder, Stéphane, Sallinger, Emanuel, Sherkhonov, Evgeny, Vahdati, Sahar, Wu, Lianlong
Publikováno v:
In Future Generation Computer Systems April 2022 129:407-422
Autor:
Nenov, Yavor Neychev
In the last two decades, qualitative spatial representation and reasoning, and in particular spatial logics, have been the subject of an increased interest from the Artificial Intelligence community. By a spatial logic, we understand a formal languag
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606867
Materialisation precomputes all consequences of a set of facts and a datalog program so that queries can be evaluated directly (i.e., independently from the program). Rewriting optimises materialisation for datalog programs with equality by replacing
Externí odkaz:
http://arxiv.org/abs/1505.00212
Rewriting is widely used to optimise owl:sameAs reasoning in materialisation based OWL 2 RL systems. We investigate issues related to both the correctness and efficiency of rewriting, and present an algorithm that guarantees correctness, improves eff
Externí odkaz:
http://arxiv.org/abs/1411.3622
We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog r
Externí odkaz:
http://arxiv.org/abs/1404.3141
Publikováno v:
In Artificial Intelligence April 2019 269:76-136
Publikováno v:
ACM Transactions on Computational Logic, 14(2:13), 2013
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These
Externí odkaz:
http://arxiv.org/abs/1110.4034