Results 81 to 90 of about 16,042 (210)

On Core XPath with Inflationary Fixed Points [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 2012
We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, inProc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002).IEEE CS Press (2002) 189–202.] extended with anInflationary Fixed Point (IFP)operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In
Afanasiev, L., ten Cate, B.
openaire   +2 more sources

Improving Web Element Localization by Using a Large Language Model

open access: yesSoftware Testing, Verification and Reliability, Volume 34, Issue 7, November 2024.
This study introduces VON Similo LLM, which combines the precision of the VON Similo algorithm with the language understanding and reasoning abilities of large language models (LLMs) to improve web element localization in GUI‐based software testing. It ranks web elements using VON Similo, selects the top 10 and uses the LLM to identify the element most
Michel Nass   +2 more
wiley   +1 more source

Axiomatizing the Logical Core of XPath 2.0 [PDF]

open access: yesTheory of Computing Systems, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ten Cate, B., Marx, M.
openaire   +5 more sources

Datacubes as enabler for advanced decision support systems in land management

open access: yesLand Degradation &Development, Volume 35, Issue 11, Page 3579-3592, 15 July 2024.
Abstract Informed, wise, land management has been a challenge since a long time, but has gained extra importance through the need for responding to climate change effects. The European Green Deal is one example of a concertation effort in a world where data availability, sharing options, and just‐in‐time exploitation are not entirely solved.
Peter Baumann   +4 more
wiley   +1 more source

Executable First-Order Queries in the Logic of Information Flows [PDF]

open access: yesLogical Methods in Computer Science
The logic of information flows (LIF) has recently been proposed as a general framework in the field of knowledge representation. In this framework, tasks of procedural nature can still be modeled in a declarative, logic-based fashion.
Heba Aamer   +4 more
doaj   +1 more source

Pathfinder: XQuery - The Relational Way [PDF]

open access: yes, 2005
Relational query processors are probably the best understood (as well as the best engineered) query engines available today. Although carefully tuned to process instances of the relational model (tables of tuples), these processors can also provide a ...
Boncz, Peter   +5 more
core   +5 more sources

Low-latency XPath Query Evaluation on Multi-Core Processors

open access: yesHawaii International Conference on System Sciences, 2017
XML and the XPath querying language have become ubiquitous data and querying standards used in many industrial settings and across the World-Wide Web.
Ben Karsin, H. Casanova, Lipyeow Lim
semanticscholar   +1 more source

An empirical study to compare three web test automation approaches: NLP‐based, programmable, and capture&replay

open access: yesJournal of Software: Evolution and Process, Volume 36, Issue 5, May 2024.
A new advancement in test automation is the use of natural language processing (NLP) to generate test cases from natural language text. NLP is innovative in this context and promises of reducing test cases creation time and simplifying understanding. This paper investigates the adoption of NLP‐based test automation in the web context with a series of ...
Maurizio Leotta   +3 more
wiley   +1 more source

Оптимизация вычисления обратных осей языка XML Path при его реализации функциональными методами.

open access: yesТруды Института системного программирования РАН, 2004
XPath – это язык для адресации структурных частей XML-документа. Функциональный язык программирования Scheme позволяет естественным образом представлять и обрабатывать XML-документы в виде SXML и обеспечивает единую среду для реализации XML-приложений.
Д.А. Лизоркин
doaj  

Complete Subhedge Projection for Stepwise Hedge Automata

open access: yesAlgorithms
We demonstrate how to evaluate stepwise hedge automata (Shas) with subhedge projection while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge ...
Antonio Al Serhali, Joachim Niehren
doaj   +1 more source

Home - About - Disclaimer - Privacy