On the public citation graph

Satisfiability of XPath Queries with Sibling Axes

https://doi.org/10.1007/11601524_8
0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11523468_4openalex-snapshot
Logics for Unranked Trees: An Overview
inferredcites →https://doi.org/10.1007/11601524_13openalex-snapshot
Efficient Memory Representation of XML Documents
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-36128-6_7openalex-snapshot
XPath: Looking Forward
inferredcites →https://doi.org/10.1007/3-540-36285-1_15openalex-snapshot
Reformulation of XML Queries and Constraints
inferredcites →https://doi.org/10.1007/3-540-36285-1_20openalex-snapshot
Containment for XPath Fragments under DTD Constraints
inferredcites →https://doi.org/10.1007/3-540-36285-1_21openalex-snapshot
XPath Containment in the Presence of Disjunction, DTDs, and Variables
inferredcites →https://doi.org/10.1007/3-540-36285-1_6openalex-snapshot
Structural Properties of XPath Fragments
inferredcites →https://doi.org/10.1007/978-1-4020-8265-8_200981openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/978-3-540-24607-7_3openalex-snapshot
Satisfiability of XPath Expressions
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_28openalex-snapshot
XPath with Conditional Axis Relations
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_53openalex-snapshot
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries
inferredcites →https://doi.org/10.1007/978-3-540-30570-5_8openalex-snapshot
First Order Paths in Ordered Trees
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-012088469-8.50014-0openalex-snapshot
On Testing Satisfiability of Tree Pattern Queries
inferredcites →https://doi.org/10.1016/b978-155860869-6/50017-2openalex-snapshot
Efficient Algorithms for Processing XPath Queries
inferredcites →https://doi.org/10.1016/s1389-1286(02)00223-2openalex-snapshot
Keys for XML
inferredcites →https://doi.org/10.1145/1007568.1007634openalex-snapshot
Secure XML querying with security views
inferredcites →https://doi.org/10.1145/1055558.1055585openalex-snapshot
Conjunctive queries over trees
inferredcites →https://doi.org/10.1145/1065167.1065172openalex-snapshot
XPath satisfiability in the presence of DTDs
inferredcites →https://doi.org/10.1145/335168.335217openalex-snapshot
Expressive and efficient pattern languages for tree-structured data (extended abstract)
inferredcites →https://doi.org/10.1145/375551.375569openalex-snapshot
Extended path expressions of XML
inferredcites →https://doi.org/10.1145/375663.375730openalex-snapshot
Minimization of tree pattern queries
inferredcites →https://doi.org/10.1145/962446.962448openalex-snapshot
Containment and equivalence for a fragment of XPath
inferredcites →https://doi.org/10.1145/974121.974140openalex-snapshot
XPath query containment
inferredcites →https://doi.org/10.1201/9781420090512-18openalex-snapshot
A Extensible Markup Language XML

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11780991_14openalex-snapshot
Count-Constraints for Generating XML
inferred← citeshttps://doi.org/10.1007/11874683_3openalex-snapshot
Automata and Logics for Words and Trees over an Infinite Alphabet
inferred← citeshttps://doi.org/10.1007/11965893_10openalex-snapshot
Axiomatizing the Logical Core of XPath 2.0
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_74openalex-snapshot
Bounded Depth Data Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-75288-2_3openalex-snapshot
XPath Query Satisfiability is in PTIME for Real-World DTDs
inferred← citeshttps://doi.org/10.1007/978-3-540-78849-2_22openalex-snapshot
A Decision Procedure for XPath Satisfiability in the Presence of DTD Containing Choice
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_10openalex-snapshot
Optimizing Conjunctive Queries over Trees Using Schema Information
inferred← citeshttps://doi.org/10.1007/978-3-642-03573-9_7openalex-snapshot
On the Termination Problem for Declarative XML Message Processing
inferred← citeshttps://doi.org/10.1007/978-3-642-03793-1_5openalex-snapshot
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_29openalex-snapshot
Future-Looking Logics on Data Words and Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-15684-7_4openalex-snapshot
Extending the Tractability Results on XPath Satisfiability with Sibling Axes
inferred← citeshttps://doi.org/10.1007/978-3-642-24577-0_20openalex-snapshot
Satisfiability of Simple XPath Fragments under Fixed DTDs
inferred← citeshttps://doi.org/10.1007/s00224-008-9151-9openalex-snapshot
Axiomatizing the Logical Core of XPath 2.0
inferred← citeshttps://doi.org/10.1007/s00236-016-0282-1openalex-snapshot
Conjunctive query containment over trees using schema information
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.025openalex-snapshot
Testing XML constraint satisfiability
inferred← citeshttps://doi.org/10.1108/17440080780000298openalex-snapshot
Sibling‐First Data Organization for Parse‐Free XML Data Processing
inferred← citeshttps://doi.org/10.1109/icsssm.2007.4280189openalex-snapshot
A High Performance Architecture for Web Service Systems in XML
inferred← citeshttps://doi.org/10.1109/lics.2007.11openalex-snapshot
Alternation-free modal mu-calculus for data trees
inferred← citeshttps://doi.org/10.1109/lics.2010.33openalex-snapshot
An Extension of Data Automata that Captures XPath
inferred← citeshttps://doi.org/10.1145/1142351.1142354openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferred← citeshttps://doi.org/10.1145/1265530.1265541openalex-snapshot
The complexity of query containment in expressive fragments of XPath 2.0
inferred← citeshttps://doi.org/10.1145/1276301.1276308openalex-snapshot
Static analysis of XML processing with data values
inferred← citeshttps://doi.org/10.1145/1346330.1346333openalex-snapshot
XPath satisfiability in the presence of DTDs
inferred← citeshttps://doi.org/10.1145/1456650.1456653openalex-snapshot
XPath leashed
inferred← citeshttps://doi.org/10.1145/1516512.1516515openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferred← citeshttps://doi.org/10.1145/1559795.1559827openalex-snapshot
Satisfiability of downward XPath with data equality tests
inferred← citeshttps://doi.org/10.1145/1568318.1568321openalex-snapshot
The complexity of query containment in expressive fragments of XPath 2.0
inferred← citeshttps://doi.org/10.1145/1651587.1651594openalex-snapshot
Satisfiability of simple xpath fragments in the presence of dtds
inferred← citeshttps://doi.org/10.1145/1804669.1804699openalex-snapshot
Forward-XPath and extended register automata on data-trees
inferred← citeshttps://doi.org/10.1145/1929954.1929956openalex-snapshot
Alternating automata on data trees and XPath satisfiability
inferred← citeshttps://doi.org/10.1145/2362355.2362362openalex-snapshot
Decidability of Downward XPath
inferred← citeshttps://doi.org/10.1145/2463664.2463675openalex-snapshot
On XPath with transitive axes and data tests
inferred← citeshttps://doi.org/10.1145/2745754.2745766openalex-snapshot
The (Almost) Complete Guide to Tree Pattern Containment
inferred← citeshttps://doi.org/10.1145/3212019.3212021openalex-snapshot
Satisfiability of Xpath on data trees
inferred← citeshttps://doi.org/10.1145/3294052.3319685openalex-snapshot
Decidable XPath Fragments in the Real World
inferred← citeshttps://doi.org/10.1145/3310337openalex-snapshot
CSS Minification via Constraint Solving
inferred← citeshttps://doi.org/10.1145/3709722openalex-snapshot
Schema-Based Query Optimisation for Graph Databases
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.1029openalex-snapshot
Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:1)2006openalex-snapshot
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:22)2012openalex-snapshot
Alternating register automata on finite words and trees
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:5)2012openalex-snapshot
An extension of data automata that captures XPath
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:5)2017openalex-snapshot
Bottom-up automata on data trees and vertical XPath
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.99openalex-snapshot
Decidable classes of documents for XPath
inferred← citeshttps://doi.org/10.70675/25d20a7dzfea8z4000z8826z89056423c46dopenalex-snapshot
Reasoning on words and trees with data
inferred← citeshttps://doi.org/10.70675/7c36bc77zbcf8z4d6ez988dzdd814ec9a952openalex-snapshot
Role of the immune receptor CD47 in mouse model of non-infectious uveitis
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.