202 search results - page 14 / 41 » Reasoning about XML with temporal logics and automata |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
TIME
2005
IEEE
15 years 3 months ago
2005
IEEE
Historical information can be effectively preserved using XML and searched through powerful historical queries written in XQuery. Indeed, by storing the successive versions of a d...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We develop a logic for representing and reasoning about coalitional games without transferable payoffs. Although a number of logics of cooperation have been proposed over the past...
103
click to vote
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...