127 search results - page 12 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
ALT
2010
Springer
13 years 4 months ago
2010
Springer
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...
NMR
2004
Springer
14 years 27 days ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
KCAP
2003
ACM
14 years 23 days ago
2003
ACM
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
COGSCI
2004
13 years 7 months ago
2004
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...