29 search results - page 3 / 6 » Tree Extension Algebras: Logics, Automata, and Query Languag... |
140
Voted
VMCAI
2010
Springer
15 years 8 months ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
211
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
126
Voted
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
117
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
125
Voted
DKE
2007
15 years 1 months ago
2007
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...