scholarly journals PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner

2015 ◽  
Vol 54 ◽  
pp. 309-367 ◽  
Author(s):  
Yujiao Zhou ◽  
Bernardo Cuenca Grau ◽  
Yavor Nenov ◽  
Mark Kaminski ◽  
Ian Horrocks
Keyword(s):  
Hybrid Approach ◽  
Expressive Power ◽  
Query Answering ◽  
Reasoning Task ◽  
First Order ◽  
Ontology Language ◽  
Extensive Evaluation ◽  
Black Boxes ◽  
Wide Range ◽  
Existential Quantification

Answering conjunctive queries over ontology-enriched datasets is a core reasoning task for many applications. Query answering is, however, computationally very expensive, which has led to the development of query answering procedures that sacrifice either expressive power of the ontology language, or the completeness of query answers in order to improve scalability. In this paper, we describe a hybrid approach to query answering over OWL 2 ontologies that combines a datalog reasoner with a fully-fledged OWL 2 reasoner in order to provide scalable `pay-as-you-go' performance. The key feature of our approach is that it delegates the bulk of the computation to the datalog reasoner and resorts to expensive OWL 2 reasoning only as necessary to fully answer the query. Furthermore, although our main goal is to efficiently answer queries over OWL 2 ontologies and data, our technical results are very general and our approach is applicable to first-order knowledge representation languages that can be captured by rules allowing for existential quantification and disjunction in the head; our only assumption is the availability of a datalog reasoner and a fully-fledged reasoner for the language of interest, both of which are used as `black boxes'. We have implemented our techniques in the PAGOdA system, which combines the datalog reasoner RDFox and the OWL 2 reasoner HermiT. Our extensive evaluation shows that PAGOdA succeeds in providing scalable pay-as-you-go query answering for a wide range of OWL 2 ontologies, datasets and queries.

scholarly journals Query Rewriting for DL-Lite with n-ary Concrete Domains

2017 ◽  
Author(s):  
Franz Baader ◽  
Stefan Borgwardt ◽  
Marcel Lippmann
Keyword(s):  
Query Answering ◽  
Query Rewriting ◽  
First Order ◽  
Ontology Language ◽  
Concrete Domains

We investigate ontology-based query answering (OBQA) in a setting where both the ontology and the query can refer to concrete values such as numbers and strings. In contrast to previous work on this topic, the built-in predicates used to compare values are not restricted to being unary. We introduce restrictions on these predicates and on the ontology language that allow us to reduce OBQA to query answering in databases using the so-called combined rewriting approach. Though at first sight our restrictions are different from the ones used in previous work, we show that our results strictly subsume some of the existing first-order rewritability results for unary predicates.

scholarly journals Towards Universal Languages for Tractable Ontology Mediated Query Answering

2020 ◽  
Vol 34 (03) ◽  
pp. 3049-3056
Author(s):  
Heng Zhang ◽  
Yan Zhang ◽  
Jia-Huai You ◽  
Zhiyong Feng ◽  
Guifei Jiang
Keyword(s):  
Query Languages ◽  
Query Answering ◽  
Data Complexity ◽  
Conjunctive Queries ◽  
Negative Side ◽  
First Order ◽  
Positive Side ◽  
Universal Language ◽  
Ontology Language ◽  
The Family

An ontology language for ontology mediated query answering (OMQA-language) is universal for a family of OMQA-languages if it is the most expressive one among this family. In this paper, we focus on three families of tractable OMQA-languages, including first-order rewritable languages and languages whose data complexity of the query answering is in AC0 or PTIME. On the negative side, we prove that there is, in general, no universal language for each of these families of languages. On the positive side, we propose a novel property, the locality, to approximate the first-order rewritability, and show that there exists a language of disjunctive embedded dependencies that is universal for the family of OMQA-languages with locality. All of these results apply to OMQA with query languages such as conjunctive queries, unions of conjunctive queries and acyclic conjunctive queries.

scholarly journals Query Answering for Existential Rules via Efficient Datalog Rewriting

2020 ◽  
Author(s):  
Zhe Wang ◽  
Peng Xiao ◽  
Kewen Wang ◽  
Zhiqiang Zhuang ◽  
Hai Wan
Keyword(s):  
State Of The Art ◽  
Query Answering ◽  
Prototype System ◽  
High Complexity ◽  
Conjunctive Queries ◽  
First Order ◽  
Wide Range ◽  
Comparable Performance

Existential rules are an expressive ontology formalism for ontology-mediated query answering and thus query answering is of high complexity, while several tractable fragments have been identified. Existing systems based on first-order rewriting methods can lead to queries too large for DBMS to handle. It is shown that datalog rewriting can result in more compact queries, yet previously proposed datalog rewriting methods are mostly inefficient for implementation. In this paper, we fill the gap by proposing an efficient datalog rewriting approach for answering conjunctive queries over existential rules, and identify and combine existing fragments of existential rules for which our rewriting method terminates. We implemented a prototype system Drewer, and experiments show that it is able to handle a wide range of benchmarks in the literature. Moreover, Drewer shows superior or comparable performance over state-of-the-art systems on both the compactness of rewriting and the efficiency of query answering.

scholarly journals Ontology-Mediated Query Answering for Key-Value Stores

2017 ◽  
Author(s):  
Meghyn Bienvenu ◽  
Pierre Bourhis ◽  
Marie-Laure Mugnier ◽  
Sophie Tison ◽  
Federico Ulliana
Keyword(s):  
Upper Bounds ◽  
Order Logic ◽  
Query Answering ◽  
Query Reformulation ◽  
Rule Based ◽  
Complexity Bounds ◽  
First Order ◽  
Ontology Language ◽  
Ontology Languages ◽  
Computational Properties

We propose a novel rule-based ontology language for JSON records and investigate its computational properties. After providing a natural translation into first-order logic, we identify relationships to existing ontology languages, which yield decidability of query answering but only rough complexity bounds. By establishing an interesting and non-trivial connection to word rewriting, we are able to pinpoint the exact combined complexity of query answering in our framework and obtain tractability results for data complexity. The upper bounds are proven using a query reformulation technique, which can be implemented on top of key-value stores, thereby exploiting their querying facilities.

Efficient Directed Densest Subgraph Discovery

2021 ◽  
Vol 50 (1) ◽  
pp. 33-40
Author(s):  
Chenhao Ma ◽  
Yixiang Fang ◽  
Reynold Cheng ◽  
Laks V.S. Lakshmanan ◽  
Wenjie Zhang ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
State Of The Art ◽  
Exact Algorithms ◽  
Large Datasets ◽  
Dense Subgraph ◽  
Extensive Evaluation ◽  
Wide Range ◽  
Edge Graph ◽  
Community Mining ◽  
Densest Subgraph

Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud detection, community mining, and graph compression. However, existing DDS solutions suffer from efficiency and scalability problems: on a threethousand- edge graph, it takes three days for one of the best exact algorithms to complete. In this paper, we develop an efficient and scalable DDS solution. We introduce the notion of [x, y]-core, which is a dense subgraph for G, and show that the densest subgraph can be accurately located through the [x, y]-core with theoretical guarantees. Based on the [x, y]-core, we develop both exact and approximation algorithms. We have performed an extensive evaluation of our approaches on eight real large datasets. The results show that our proposed solutions are up to six orders of magnitude faster than the state-of-the-art.

scholarly journals Constructing weak simulations from linear implications for processes with private names

2019 ◽  
Vol 29 (8) ◽  
pp. 1275-1308 ◽  
Author(s):  
Ross Horne ◽  
Alwen Tiu
Keyword(s):  
Expressive Power ◽  
Dual Pair ◽  
Proof System ◽  
Branching Time ◽  
First Order ◽  
Order Extension

AbstractThis paper clarifies that linear implication defines a branching-time preorder, preserved in all contexts, when used to compare embeddings of process in non-commutative logic. The logic considered is a first-order extension of the proof system BV featuring a de Morgan dual pair of nominal quantifiers, called BV1. An embedding of π-calculus processes as formulae in BV1 is defined, and the soundness of linear implication in BV1 with respect to a notion of weak simulation in the π -calculus is established. A novel contribution of this work is that we generalise the notion of a ‘left proof’ to a class of formulae sufficiently large to compare embeddings of processes, from which simulating execution steps are extracted. We illustrate the expressive power of BV1 by demonstrating that results extend to the internal π -calculus, where privacy of inputs is guaranteed. We also remark that linear implication is strictly finer than any interleaving preorder.

Design, implementation, and evaluation of an XG-PON module for the ns-3 network simulator

SIMULATION ◽  
2017 ◽  
Vol 93 (5) ◽  
pp. 409-426 ◽  
Author(s):  
Jerome A Arokkiam ◽  
Pedro Alvarez ◽  
Xiuchao Wu ◽  
Kenneth N Brown ◽  
Cormac J Sreenan ◽  
...  
Keyword(s):  
Optical Network ◽  
Future Internet ◽  
Access Networks ◽  
Passive Optical Network ◽  
Network Simulator ◽  
Optical Access Networks ◽  
Research Topics ◽  
Extensive Evaluation ◽  
Wide Range ◽  
And Performance

10-gigabit-capable Passive Optical Network (XG-PON), one of the latest standards of optical access networks, is regarded as one of the key technologies for future Internet access networks. This paper presents the design and evaluation of our XG-PON module for the ns-3 network simulator. This module is designed and implemented with the aim to provide a standards-compliant, configurable, and extensible module that can simulate XG-PON with reasonable speed and support a wide range of research topics. These include analyzing and improving the performance of XG-PON, studying the interactions between XG-PON and the upper-layer protocols, and investigating its integration with various wireless networks. In this paper, we discuss its design principles, describe the implementation details, and present an extensive evaluation on both functionality and performance.

scholarly journals UV Spectrophotometric Simultaneous Determination of Paracetamol and Ibuprofen in Combined Tablets by Derivative and Wavelet Transforms

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Vu Dang Hoang ◽  
Dong Thi Ha Ly ◽  
Nguyen Huu Tho ◽  
Hue Minh Thi Nguyen
Keyword(s):  
Simultaneous Determination ◽  
Wavelet Transforms ◽  
Hybrid Approach ◽  
Uv Spectra ◽  
Order Derivative ◽  
First Order ◽  
Spectrophotometric Methods ◽  
Combined Use ◽  
Linear Concentration

The application of first-order derivative and wavelet transforms to UV spectra and ratio spectra was proposed for the simultaneous determination of ibuprofen and paracetamol in their combined tablets. A new hybrid approach on the combined use of first-order derivative and wavelet transforms to spectra was also discussed. In this application, DWT (sym6 and haar), CWT (mexh), and FWT were optimized to give the highest spectral recoveries. Calibration graphs in the linear concentration ranges of ibuprofen (12–32 mg/L) and paracetamol (20–40 mg/L) were obtained by measuring the amplitudes of the transformed signals. Our proposed spectrophotometric methods were statistically compared to HPLC in terms of precision and accuracy.

Critical examination of various approaches used for analysing helical cables

1994 ◽  
Vol 29 (1) ◽  
pp. 43-55 ◽  
Author(s):  
M Raoof ◽  
I Kraincanic
Keyword(s):  
Large Diameter ◽  
Numerical Results ◽  
Hertzian Contact ◽  
Critical Examination ◽  
First Order ◽  
Wide Range ◽  
End Conditions ◽  
Parametric Studies ◽  
The Individual ◽  
Fixed End

Using theoretical parametric studies covering a wide range of cable (and wire) diameters and lay angles, the range of validity of various approaches used for analysing helical cables are critically examined. Numerical results strongly suggest that for multi-layered steel strands with small wire/cable diameter ratios, the bending and torsional stiffnesses of the individual wires may safely be ignored when calculating the 2 × 2 matrix for strand axial/torsional stiffnesses. However, such bending and torsional wire stiffnesses are shown to be first order parameters in analysing the overall axial and torsional stiffnesses of, say, seven wire stands, especially under free-fixed end conditions with respect to torsional movements. Interwire contact deformations are shown to be of great importance in evaluating the axial and torsional stiffnesses of large diameter multi-layered steel strands. Their importance diminishes as the number of wires associated with smaller diameter cables decreases. Using a modified version of a previously reported theoretical model for analysing multilayered instrumentation cables, the importance of allowing for the influence of contact deformations in compliant layers on cable overall characteristics such as axial or torsional stiffnesses is demonstrated by theoretical numerical results. In particular, non-Hertzian contact formulations are used to obtain the interlayer compliances in instrumentation cables in preference to a previously reported model employing Hertzian theory with its associated limitations.

Application of LWD Multipole Sonic for Quantitative Cement Evaluation – Well Integrity in the Norwegian Continental Shelf

2021 ◽  
Author(s):  
Subhadeep Sarkar ◽  
Mathias Horstmann ◽  
Tore Oian ◽  
Piotr Byrski ◽  
George Lawrence ◽  
...  
Keyword(s):  
Continental Shelf ◽  
Time Window ◽  
Full Range ◽  
Hybrid Approach ◽  
Bond Quality ◽  
Bond Index ◽  
Early Evaluation ◽  
Well Integrity ◽  
Wide Range ◽  
Norwegian Continental Shelf

Abstract One of the crucial components of well integrity evaluation in offshore drilling is to determine the cement bond quality assuring proper hydraulic sealing. On the Norwegian Continental Shelf (NCS) an industry standard as informative reference imposes verification of cement length and potential barriers using bonding logs. Traditionally, for the last 50 years, wireline (WL) sonic tools have been extensively used for this purpose. However, the applicability of logging-while-drilling (LWD) sonic tools for quantitative cement evaluation was explored in the recent development drilling campaign on the Dvalin Field in the Norwegian Sea, owing to significant advantages on operational efficiency and tool conveyance in any well trajectory. Cement bond evaluation from conventional peak-to-peak amplitude method has shown robust results up to bond indexes of 0.6 for LWD sonic tools. Above this limit, the casing signal is smaller than the collar signal and the amplitude method loses sensitivity to bonding. This practical challenge in the LWD realm was overcome through the inclusion of attenuation rate measurements, which responds accordingly in higher bonding environments. The two methods are used in a hybrid approach providing a full range quantitative bond index (QBI) introduced by Izuhara et al. (2017). In order to conform with local requirements related to well integrity and to ascertain the QBI potential from LWD monopole sonic, a wireline cement bond log (CBL) was acquired in the first well of the campaign for comparison. This enabled the strategic deployment of LWD QBI service in subsequent wells. LWD sonic monopole data was acquired at a controlled speed of 900ft/h. The high-fidelity waveforms were analyzed in a suitable time window and both amplitude- and attenuation-based bond indexes were derived. The combined hybrid bond index showed an excellent match with the wireline reference CBL, both in zones of high as well as lower cement bonding. The presence of formation arrivals was also in good correlation with zones of proper bonding distinguishable on the QBI results. This established the robustness of the LWD cement logging and ensured its applicability in the rest of the campaign which was carried out successfully. While the results from LWD cement evaluation service are omnidirectional, it comes with a wide range of benefits related to rig cost or conveyance in tough borehole trajectories. Early evaluation of cement quality by LWD sonic tools helps to provide adequate time for taking remedial actions if necessary. The LWD sonic as part of the drilling BHA enables this acquisition and service in non-dedicated runs, with the possibility of multiple passes for observing time-lapse effects. Also, the large sizes of LWD tools relative to the wellbore ensures a lower signal attenuation in the annulus and more effective stabilization, thereby providing a reliable bond index.

Sign in / Sign up

Export Citation Format

Share Document