Search Results - XPATH EXPRESSIONS

  • Showing 1 - 12 results of 12
Refine Results
  1. 1

    An extension of data automata that captures XPath by Mikołaj Bojańczyk, Sławomir Lasota

    Published in Logical Methods in Computer Science (2012-02-01)
    “…We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automata-theoretic approach may be applied to answer decidability and expressibility questions for XPath.…”
    Get full text
    Article
  2. 2
  3. 3

    On the complexity of XPath containment in the presence of disjunction, DTDs, and variables by Frank Neven, Thomas Schwentick

    Published in Logical Methods in Computer Science (2006-07-01)
    “…The focus in this paper is on the complexity of the containment problem for various fragments of XPath. We restrict attention to the most common XPath expressions which navigate along the child and/or descendant axis. …”
    Get full text
    Article
  4. 4

    Automatic XPath generation agents for vertical websites by LLMs by Jing Huang, Jie Song

    “…To address these challenges we propose a new framework that leverages a multi-task decomposition strategy, enabling LLMs, despite their limitations in handling structured information, to learn robust XPath expressions from seed pages and apply them to unseen web pages. …”
    Get full text
    Article
  5. 5

    Bottom-up automata on data trees and vertical XPath by Diego Figueira, Luc Segoufin

    Published in Logical Methods in Computer Science (2017-11-01)
    “…We show that it captures the expressive power of the vertical fragment of XPath - containing the child, descendant, parent and ancestor axes - obtaining thus a decision procedure for its satisfiability problem.…”
    Get full text
    Article
  6. 6
  7. 7

    An Approach of XML Query Evaluation Based Model Checking by Yan-Mei Li, Shao-Bin Huang, Ya Li, Li Xu

    Published in Cybernetics and Information Technologies (2016-12-01)
    “…We investigate the potential ofatechnique based on CTL (Computation Tree Logic) model checking for evaluating queries expressed in (a subset of) XPath. Our research consists of query algebra, constraint understanding and expression mapping. …”
    Get full text
    Article
  8. 8

    Automata Approach to XML Data Indexing by Eliška Šestáková, Jan Janoušek

    Published in Information (2018-01-01)
    “…Trees are among the fundamental and well-studied data structures in computer science. They express a hierarchical structure and are widely used in many applications. …”
    Get full text
    Article
  9. 9

    Executable First-Order Queries in the Logic of Information Flows by Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche

    Published in Logical Methods in Computer Science (2024-05-01)
    “…One can also classify the variables in FLIF expressions as inputs and outputs. Expressions where inputs and outputs are disjoint, referred to as io-disjoint FLIF expressions, allow a particularly transparent translation into algebraic query plans that respect the access limitations. …”
    Get full text
    Article
  10. 10

    Seahawk: moving beyond HTML in Web-based bioinformatics analysis by Sensen Christoph W, Gordon Paul MK

    Published in BMC Bioinformatics (2007-06-01)
    “…Underlying the familiar Web-browser interaction is an XML data engine based on extensible XSLT style sheets, regular expressions, and XPath statements which import existing user data into the MOBY-S format.…”
    Get full text
    Article
  11. 11

    Global Numerical Constraints on Trees by Everardo Bárcenas, Jesús Lavalle

    Published in Logical Methods in Computer Science (2014-06-01)
    “…Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of a given node. …”
    Get full text
    Article
  12. 12

    Containment for Conditional Tree Patterns by Alessandro Facchini, Yoichi Hirai, Maarten Marx, Evgeny Sherkhonov

    Published in Logical Methods in Computer Science (2015-06-01)
    “…CTP is a positive, forward, first order fragment of Regular XPath. Unlike TP, CTP expanded with disjunction is not equivalent to unions of CTP's. …”
    Get full text
    Article

Search Tools: