Skip to main content

9 Result(s)

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

and

  1. Chapter and Conference Paper

    A Space Efficient Solution to the Frequent String Mining Problem for Many Databases

    In the frequent string mining problem, one is given m databases \({\cal D}_1,...,{\cal D}_m\) of strings and searches f...

    Adrian Kügel, Enno Ohlebusch in Machine Learning and Knowledge Discovery in Databases (2008)

    Download PDF (187 KB)

  2. No Access

    Chapter and Conference Paper

    TALP: A Tool for the Termination Analysis of Logic Programs

    In the last decade, the automatic termination analysis of logic programs has been receiving increasing attention. Among other methods, techniques have been proposed that transform a well-moded logic program in...

    Enno Ohlebusch, Claus Claves, Claude Marché in Rewriting Techniques and Applications (2000)

  3. 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)

  4. No Access

    Chapter and Conference Paper

    Church-Rosser theorems for abstract reduction modulo an equivalence relation

    A very powerful method for proving the Church-Rosser property for abstract rewriting systems has been developed by van Oostrom. In this paper, his technique is extended in two ways to abstract rewriting modulo...

    Enno Ohlebusch in Rewriting Techniques and Applications (1998)

  5. 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)

  6. 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)

  7. No Access

    Chapter and Conference Paper

    Modular properties of constructor-sharing conditional term rewriting systems

    First, using a recent modularity result [Ohl94b] for unconditional term rewriting systems (TRSs), it is shown that semi-completeness is a modular property of constructor-sharing join conditional term rewriting...

    Enno Ohlebusch in Conditional and Typed Rewriting Systems (1995)

  8. No Access

    Chapter and Conference Paper

    A new calculus for semantic matching

    In this paper, we present Reverse Restructuring, a new calculus for solving the semantic matching problem. For narrowing, advanced selection rules are commonly seen as an appropriate method to reduce the searc...

    Bernd Bütow, Robert Giegerich… in Programming Languages: Implementations, Lo… (1995)

  9. No Access

    Chapter and Conference Paper

    Combinations of simplifying conditional term rewriting systems

    A conditional term rewriting system (CTRS) is called simplifying if there exists a simplification ordering > on terms such that the left-hand side of any rewrite rule is greater than the right-hand side and th...

    Enno Ohlebusch in Conditional Term Rewriting Systems (1993)