XPath

swMATH15780MaRDI QIDQ27652

No author found.

Related Items (only showing first 100 items - show all)

An extension of data automata that captures XPath ⋮ Alternating register automata on finite words and trees ⋮ Limiting Until in Ordered Tree Query Languages ⋮ Unnamed Item ⋮ Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Containment of Monadic Datalog Programs via Bounded Clique-Width ⋮ Some modal aspects of XPath ⋮ Unnamed Item ⋮ Beyond multi-adjoint logic programming ⋮ The complexity of query containment in expressive fragments of XPath 2.0 ⋮ Related axis: the extension to XPath towards effective XML search ⋮ Future-Looking Logics on Data Words and Trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Rewrite Approach for Pattern Containment ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semantic Acyclicity on Graph Databases ⋮ XML Schema Mappings ⋮ Scrap your boilerplate with XPath-like combinators ⋮ On the complexity of XPath containment in the presence of disjunction, DTDs, and variables ⋮ Unnamed Item ⋮ Monadic Datalog and Regular Tree Pattern Queries ⋮ Logics with rigidly guarded data tests ⋮ Expressive Path Queries on Graph with Data ⋮ Early Nested Word Automata for XPath Query Answering on XML Streams ⋮ Unnamed Item ⋮ Definability for Downward and Vertical XPath on Data Trees ⋮ Unnamed Item ⋮ Thresholded semantic framework for a fully integrated fuzzy logic language ⋮ Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization ⋮ Containment for Conditional Tree Patterns ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ A type theory for memory allocation and data layout ⋮ Satisfiability of Constraint Specifications on XML Documents ⋮ Alternating automata on data trees and XPath satisfiability ⋮ Decidability of Downward XPath ⋮ Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ Balanced tree partition problems with virtual nodes ⋮ Learning tree languages from text ⋮ The query language to XML documents connected by XLink links ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Unnamed Item ⋮ Automata for Positive Core XPath Queries on Compressed Documents ⋮ The complexity of XPath query evaluation and XML typing ⋮ On the minimization of XPath queries ⋮ XPath satisfiability in the presence of DTDs ⋮ Path constraints in semistructured data ⋮ XPath evaluation in linear time ⋮ Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees ⋮ Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book ⋮ Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices ⋮ Unnamed Item ⋮ Federation and Navigation in SPARQL 1.1 ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ A resolution calculus for the branching-time temporal logic CTL ⋮ Behavioural equivalences for dynamic web data ⋮ Algebraic Specialization of Generic Functions for Recursive Types ⋮ Constraint-aware Schema Transformation ⋮ Unnamed Item ⋮ Transitive closure logic, nested tree walking automata, and XPath ⋮ The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey ⋮ XPath-logic and XPathLog: A logic-programming style XML data manipulation language ⋮ Automated Reasoning with Analytic Tableaux and Related Methods ⋮ Characterizing EF and EX tree logics ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams ⋮ Streamable Fragments of Forward XPath ⋮ Advanced structural joins using element distribution ⋮ Fuzzy data modeling and algebraic operations in XML ⋮ Approximation and Scoring for XML Data Management ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates ⋮ Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs ⋮ MathLang Translation to Isabelle Syntax ⋮ Compact Representation for Answer Sets of n-ary Regular Queries ⋮ Logical Foundations of XML and XQuery ⋮ Foundations of RDF Databases ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Defending against Attribute-Correlation Attacks in Privacy-Aware Information Brokering ⋮ Access Control Model for Sharing Composite Electronic Health Records ⋮ Ontology Support for Managing Top-Down Changes in Composite Services ⋮ Database Programming Languages ⋮ On Core XPath with Inflationary Fixed Points ⋮ Modelling dynamic web data ⋮ Containment and equivalence for a fragment of XPath ⋮ Unary negation ⋮ Unnamed Item ⋮ Controllable Combinatorial Coverage in Grammar-Based Testing ⋮ Computerizing Mathematical Text with MathLang ⋮ PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems ⋮ Testing XML constraint satisfiability ⋮ Lower Bounds for Multi-Pass Processing of Multiple Data Streams

This page was built for software: XPath