Skip to main content

3 Result(s)

within Enno Ohlebusch Remove this filter Artificial Intelligence Remove this filter Computer System Implementation Remove this filter Mathematical Logic and Formal Languages Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems

    Deterministic conditional rewrite systems are interesting because they permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive, then it is terminating and has a computa...

    Enno Ohlebusch in Logic for Programming and Automated Reasoning (1999)

  2. No Access

    Chapter and Conference Paper

    Conditional term graph rewriting

    For efficiency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see [BEG+87...

    Enno Ohlebusch in Algebraic and Logic Programming (1997)

  3. No Access

    Chapter and Conference Paper

    Relative undecidability in term rewriting

    For two hierarchies of properties of term rewriting systems related to confluence and termination, respectively, we prove relative undecidability: for implications X⇒Y in the hierarchies the property X is undecid...

    Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema in Computer Science Logic (1997)