scholarly journals Early nested word automata for XPath query answering on XML streams

2015 ◽  
Vol 578 ◽  
pp. 100-125 ◽  
Author(s):  
Denis Debarbieux ◽  
Olivier Gauwin ◽  
Joachim Niehren ◽  
Tom Sebastian ◽  
Mohamed Zergaoui
Keyword(s):  
Query Answering ◽  
Xml Streams ◽  
Xpath Query

scholarly journals Early Nested Word Automata for XPath Query Answering on XML Streams

2013 ◽  
pp. 292-305 ◽  
Author(s):  
Denis Debarbieux ◽  
Olivier Gauwin ◽  
Joachim Niehren ◽  
Tom Sebastian ◽  
Mohamed Zergaoui
Keyword(s):  
Query Answering ◽  
Xml Streams ◽  
Xpath Query

Computing Cores for Existential Rules with the Standard Chase and ASP

2020 ◽  
Author(s):  
Markus Krötzsch
Keyword(s):  
Large Class ◽  
Data Exchange ◽  
Answer Set Programming ◽  
Query Answering ◽  
Universal Model ◽  
The Core ◽  
Universal Models ◽  
General Terms ◽  
Special Cases ◽  
The Many

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

scholarly journals A Partial-tree-based Approach for XPath Query on Large XML Trees

2016 ◽  
Vol 24 (2) ◽  
pp. 425-438 ◽  
Author(s):  
Wei Hao ◽  
Kiminori Matsuzaki
Keyword(s):  
Partial Tree ◽  
Xpath Query
Sign in / Sign up

Export Citation Format

Share Document