419 search results - page 5 / 84 » First Order Paths in Ordered Trees |
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
ALT
2003
Springer
14 years 6 days ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...