Sciweavers

39 search results - page 3 / 8
» On Rational Trees
Sort
View
LPAR
2001
Springer
13 years 10 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
ALT
2010
Springer
13 years 2 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
LATA
2009
Springer
14 years 26 days ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
COLING
1996
13 years 7 months ago
Decision Tree Learning Algorithm with Structured Attributes: Application to Verbal Case Frame Acquisition
The Decision Tree Learning Algorithms (DTLAs) are getting keen attention from the natural language processing research comlnunity, and there have been a series of attempts to appl...
Hideki Tanaka
ISIPTA
1999
IEEE
139views Mathematics» more  ISIPTA 1999»
13 years 10 months ago
Rational Decision Making With Imprecise Probabilities
Decision criteria based on an imprecise probability representation of uncertainty have been criticized, from the normative point of view, on the grounds that they make the decisio...
Jean-Yves Jaffray