Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

RTA
2010
Springer

favoriteEmaildiscussreport

148views Theoretical Computer Science» more RTA 2010»

Underspecified computation of normal forms

14 years 20 days ago

Underspecified computation of normal forms

Download www.coli.uni-saarland.de

We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of formulas that are described by dominance graphs, and a certain class of rewrite systems that we use to approximate entailment, and show how to compute the irreducible trees efficiently by intersecting tree automata. Our algorithm solves a 25-year-old problem in computational linguistics.

Alexander Koller, Stefan Thater

Real-time Traffic

Dominance Graphs | Irreducible Trees | Rewrite System R | RTA 2010 | Theoretical Computer Science |

claim paper

Related Content

» Minimal Recursion Semantics as Dominance Constraints Translation Evaluation and Analysis

» A Linear Space Algorithm for Computing the Hermite Normal Form

» Ideal decompositions and computation of tensor normal forms

» Local Normal Forms for FirstOrder Logic with Applications to Games and Automata

» Decidable Approximations of Sets of Descendants and Sets of Normal Forms

» Deep Inference and Its Normal Form of Derivations

» Decidability of Regularity and Related Properties of Ground Normal Form Languages

» Call by Need Computations to RootStable Form

» Stable normal forms for polynomial system solving

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2010
Where	RTA
Authors	Alexander Koller, Stefan Thater

Comments (0)