Sciweavers

119

Voted

COLT
1992
Springer

103views Machine Learning» more COLT 1992»

Polynomial Time Inference of a Subclass of Context-Free Transformations

15 years 7 months ago

This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers