Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"Rewriting rules"”.

  1. An interactive graphical program for specification and application of web rewriting rules

    … description in computer graphics. They apply the rewriting procedure typical of string grammars to general directed graphs or "webs". An interactive graphical system is implemented to provide an easy and convenient way to manipulate and specify a web in a natural manner. This project is based on a …

    ubc Repository record for An interactive graphical program for specification and application of web rewriting rules (opens in a new tab) Download PDF for An interactive graphical program for specification and application of web rewriting rules (opens in a new tab)

  2. Inferring Different Types of Lindenmayer Systems Using Artificial Intelligence

    … formal grammar system which consist of a set of rewriting rules. Each rewriting rule is comprised of a symbol to replace (predecessor), a replacement string (successor), and an optional condition that is necessary for replacement. Starting with an initial string, every symbol in the string is …

    sask Repository record for Inferring Different Types of Lindenmayer Systems Using Artificial Intelligence (opens in a new tab)

  3. A port graph rewriting system for visual data modelling

    … modelling, based on strategic port graph rewriting.<br/><br/>More precisely, the contributions are as follows. A port graph visual language to model relational database schemata is presented. The standard notion of port graph rewrite rule is extended with generic Rule Application …

    kings Repository record for A port graph rewriting system for visual data modelling (opens in a new tab) Download PDF for A port graph rewriting system for visual data modelling (opens in a new tab)

  4. Table recognition in mathematical documents

    … complex mathematical table structures. A set of rewriting rules applied to the graph allows for reliable re-composition of cells in order to identify several valid table interpretations. We demonstrate the effectiveness of our technique by applying them to a set of mathematical tables from …

    birmingham Download PDF for Table recognition in mathematical documents (opens in a new tab)

  5. A comparative study of formalisms for programming language definition : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University

    … may be obtained either by allowing unrestricted rules and meta-variables in the phrase-structure, or by associating mathematical functions either with individual production rules or with the whole context-free structure, to transform it into an 'abstract syntax'. Since the form of a definition of …

    massey Repository record for A comparative study of formalisms for programming language definition : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University (opens in a new tab)

  6. An optimizing code generator generator.

    … are based on a very simple formalism, namely rewriting rules. An instrumented version of the compiler infers the optimization rules as it complies a training suite, and it records them for translation into hard code and inclusion into the production version. I have replaced the Portable C …

    arizona-thes Repository record for An optimizing code generator generator. (opens in a new tab)

  7. XQuery Query Processing in Relational Systems

    … <em>Merge-join</em> patterns and query rewriting rules are designed to identify XQuery fragments that can utilize the efficient <em>merge-join</em> evaluation. Proofs of correctness of the approach are provided in the thesis. Experimental results justify the correctness of our work.

    waterloo Repository record for XQuery Query Processing in Relational Systems (opens in a new tab)

  8. Foundations of SPARQL query optimization

    … algebra, including both the investigation of rewriting rules like filter and projection pushing that are well-known from relational algebra optimization as well as SPARQL-specific rewriting schemes; (iv) an approach to the semantic optimization of SPARQL queries, built on top of the classical …

    freiburg-diss Repository record for Foundations of SPARQL query optimization (opens in a new tab)

  9. Formalising privacy regulations with bigraphs

    … BRSs evolve over time via user-specified rewriting rules that can be defined algebraically and diagrammatically. The rewrite rules describe system behaviour and allow flexibility in integrating privacy policies with user defined systems. To increase usability, we advocate a diagrammatic …

    glasgow Repository record for Formalising privacy regulations with bigraphs (opens in a new tab) Download PDF for Formalising privacy regulations with bigraphs (opens in a new tab)

  10. Declarative Programming via Term Rewriting

    … For the operational semantics, I develop a term-rewriting system that executes a program by simplifying its corresponding algebraic expression. I have used this approach to create the first complete implementation of the Dyna programming language. A Dyna program consists of rules that define a …

    jhu Repository record for Declarative Programming via Term Rewriting (opens in a new tab)

  11. Strategic Modelling with Graph Rewriting Tools

    … and convey intuitions or ideas about it. Graph rewriting rules can be used to model their dynamic evolution and from a practical point of view, graph transformations have many applications in specification, programming, and simulation tools. Strategic rewriting has been studied for term …

    kings Repository record for Strategic Modelling with Graph Rewriting Tools (opens in a new tab) Download PDF for Strategic Modelling with Graph Rewriting Tools (opens in a new tab)

  12. Formal verification of biologically inspired computing models

    … labelled multiset-based terms and generic rewriting rules. To apply a rule, variable terms in its lhs (left-hand-side) and promoters need to be unified against system terms. Although several first-order unification algorithms were proposed in previous work, none of them can be readily …

    auckland-ms Repository record for Formal verification of biologically inspired computing models (opens in a new tab)

  13. Design of a realtime high speed recognizer for unconstrained handprinted alphanumeric characters

    … readily through simple transformations or rewriting rules from the chain coded digraph. The ARG representation of an image describes the shape primitives in the image and their relationships. Final classification of the input image can be made by comparing its ARG with the ARGs of known …

    ubc Repository record for Design of a realtime high speed recognizer for unconstrained handprinted alphanumeric characters (opens in a new tab) Download PDF for Design of a realtime high speed recognizer for unconstrained handprinted alphanumeric characters (opens in a new tab)

  14. Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics

    … database techniques, such as caching and query rewriting, in the context of an assertion retrieval algebra. The main contributions of this work are two-fold: one concerns optimizing the fundamental reasoning task that underlies assertion retrieval, namely, instance checking, and the other …

    waterloo Repository record for Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics (opens in a new tab)

  15. The Eukaryotic Chromatin Computer

    … in histone-modifying enzymes implement local rewriting rules that are capable of \\\"recomputing\\\" the desired parental patterns of histone post-translational modifications on the basis of the partial information contained in that half of the nucleosomes that predate replication. It is …

    qucosa-diss

  16. Developing effcient simulators for cell machines

    … axons. In general, P systems operate by applying rewriting rules de_ned over multisets of objects associated to the di_erent membranes, in a synchronized non-deterministic maximally parallel way. P systems show a double level of parallelism: a first level comprises parallel application of rules …

    sevilla Repository record for Developing effcient simulators for cell machines (opens in a new tab)

  17. Weighted Parsing Formalisms Based on Regular Tree Grammars

    … describe a process of generating strings using rewriting rules. For modeling natural language, these rules follow an important aspect of its syntax: constituency, i.e., the hierarchical structure of phrases. The best known grammar formalism is given by context-free grammars (CFG). However, CFG …

    qucosa-diss

  18. Quantitative architecture styles

    … the Maude system, which is an implementation of rewriting logic, we accomplish to compute the full normal form of every weighted formula in an automated way. We present the code with rewriting rules of our logic and the time performance of the code when we consider weighted formulas formalizing …

    greece Repository record for Quantitative architecture styles (opens in a new tab)

  19. XML query processing: architecture and algorithms for optimization and execution

    … logical algebra and on a comprehensive set of rewritings. Experimental evaluation of the effectiveness of the overall GeCOEX system have shown that the execution time of the chosen plan is within 12% of the optimal execution time in all but one of the queries in the tested workloads. The GeCOEX …

    greece Repository record for XML query processing: architecture and algorithms for optimization and execution (opens in a new tab)