1882 search results - page 1 / 377 » Transformational Programming and Forests |
MPC
1989
Springer
13 years 11 months ago
1989
Springer
IPL
2008
13 years 7 months ago
2008
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
LATIN
2010
Springer
14 years 14 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...