arXiv subjects

Peter Hansen

Publications and source records attributed to Peter Hansen.

3 recordsLinked to original sources

arXiv2020

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from ExpTime via NExpTime to 2ExpTime, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise.

cs.AI↗

arXiv2018

A Wavelet Based Pile-Up Mitigation Method for the LHC Upgrade

Collision experiments at the Large Hadron Collider suffer from the problem of pile-up, which is the read-out of multiple simultaneous background proton-proton collisions per beam-crossing. We introduce a pile-up mitigation technique based on wavelet decomposition. Pile-up is treated as a form of white noise, which can be removed by filtering beam-crossing events in the wavelet domain. The particle-level performance of the method is evaluated using a sample of simulated proton-proton collision events that contain Z bosons decaying to a pair of neutrinos, overlaid with pile-up. In the wavelet representation, the pile-up noise level is found to grow with the square root of the number of background proton-proton collisions.

hep-ph↗

arXiv2018

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic EL and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs that are based on the simpler atomic queries, also illuminating the relationship between first-order rewritings of OMQs based on conjunctive and on atomic queries. Experiments with real-world ontologies show promising results.

cs.AI↗