903 search results - page 55 / 181 » Non-well-founded trees in categories |
119
click to vote
ACL
2006
15 years 3 months ago
2006
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
123
click to vote
ACL
1989
15 years 3 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
108
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
125
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...