Amanote Research

Amanote Research

  • Register
  • Sign In

XPath Satisfiability in the Presence of DTDs

Journal of the ACM- United States

doi 10.1145/1346330.1346333

Full Text

Abstract

Available in

Categories

ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware

Date

May 1, 2008

Authors

Michael BenediktWenfei FanFloris Geerts

Publisher

Association for Computing Machinery (ACM)


Related search

Which DTDs Are Streaming Bounded Repairable?

2013English

XPath Processing in a Nutshell

SIGMOD Record
Information SystemsSoftware
2003English

Axiomatizing the Logical Core of XPath 2.0

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2008English

Semantic Characterizations of Navigational XPath

SIGMOD Record
Information SystemsSoftware
2005English

Structural Similarity Between XML Documents and DTDs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Logic-Based XPath Optimization

2004English

Boolean Satisfiability in Quantum Compilation

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Satisfiability of Inequalities in a Poset

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1996English

XPlainer: Visual Explanations of XPath Queries

2007English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy