Sciweavers

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

25

IPL
2000

favoriteEmaildiscussreport

94views more IPL 2000»

On rewrite constraints and context unification

13 years 10 months ago

On rewrite constraints and context unification

Download www.ps.uni-saarland.de

We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability problem of slightly generalized rewriting constraints. Key words: Automatic Theorem Proving; Theory of Computation; Unification; Rewrite Constraints.

Joachim Niehren, Sophie Tison, Ralf Treinen

Real-time Traffic

Context Unification | Expressive Fragments | IPL 2000 | Satisfiability Problem |

claim paper

Related Content

» Linear SecondOrder Unification and Context Unification with TreeRegular Constraints

» Stratified Context Unification Is NPComplete

» On the relation between Context and Sequence Unification

» Equational Reasoning using AC Constraints

» Towards a Sharing Strategy for the Graph Rewriting Calculus

» Parallelism Constraints

» Orderings and Constraints Theory and Practice of Proving Termination

» Disjunctions and Inheritance in the Context Feature Structure System

» Termination of narrowing via termination of rewriting

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IPL
Authors	Joachim Niehren, Sophie Tison, Ralf Treinen

Comments (0)