127 search results - page 13 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
ESOP
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...