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 20 of 32 for “"Rewrite Rules"”.

  1. An algorithm to test for confluence in a system of left to right rewrite rules.

    … so that axioms are treated as left to right rewrite rules, rather than as mathematical equalities. The major result of the research is a new and practical algorithm to determine confluence in an axiom system of left to right rewrite rules that satisfy certain restrictions.

    nps Repository record for An algorithm to test for confluence in a system of left to right rewrite rules. (opens in a new tab)

  2. Specification-Driven Optimization

    … transformations via the specification of rewrite rules. A clean separation of the rules from the strategy of applying them makes the system easier to use and modify, compared to other integrated systems. This is especially relevant to the application-specific improvement of code, which is …

    portland-state Repository record for Specification-Driven Optimization (opens in a new tab)

  3. Preservation of determinism in MBQC under ZX-calculus rewrites

    … computations, being able to represent and rewrite both quantum circuits and measurement-based quantum computations (MBQCs) in a natural way, along with acting as a tool to translate between the two aforementioned types of quantum computation. Finding a circuit that is equivalent to a …

    birmingham Download PDF for Preservation of determinism in MBQC under ZX-calculus rewrites (opens in a new tab)

  4. ASTRAL: A Framework for Modern SQL Compiler

    … trees (ASTs) for specific patterns to apply rewrite rules. This search is often a major performance bottleneck, particularly for large or complex programs. In this thesis, I develop a declaratively specified framework for SQL compiler optimization that leverages incremental view …

    buffalo Repository record for ASTRAL: A Framework for Modern SQL Compiler (opens in a new tab)

  5. Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs

    … the specification of functional programs using rewrite rules. The package detects certain recursions of a cyclical nature, and through repeated refinement of a set of initial guesses of final values for relevant terms, arrives at a value consistent with the equations used to define the …

    uiuc Repository record for Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs (opens in a new tab)

  6. Declarative Programming via Term Rewriting

    … programming language. A Dyna program consists of rules that define a potentially infinite and cyclic computation graph, which is queried to answer data-dependent questions. Dyna is a unified declarative framework for machine learning and artificial intelligence researchers that supports dynamic …

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

  7. PARSONS PROBLEMS IN LOGIC TUTORING SYSTEMS

    … it challenging to work with logical formulas and rewrite rules. It often takes a significant amount of effort from students to fully<br/>comprehend these concepts, which can lead to discouragement and even dropout of the<br/>programme.<br/>Learning the subject matter can be challenging due to …

    openu Repository record for PARSONS PROBLEMS IN LOGIC TUTORING SYSTEMS (opens in a new tab) Download PDF for PARSONS PROBLEMS IN LOGIC TUTORING SYSTEMS (opens in a new tab)

  8. Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel

    … translates user-defined functions in the form of rewrite rules into code that performs evaluation of these functions by the strategy of needed narrowing. In addition, Goedel's mechanism that evaluates predicates is supplemented so that needed narrowing is still maintained as the evaluation …

    portland-state Repository record for Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel (opens in a new tab)

  9. Compiling Evaluable Functions in the Gödel Programming Language

    … clauses. They are defined in extended Gödel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function …

    portland-state Repository record for Compiling Evaluable Functions in the Gödel Programming Language (opens in a new tab)

  10. Dynamic set reasoning: Specifying and optimizing monitor encodings

    … those behaviors. We also present a set of MLTL rewrite rules and use equality saturation to optimize MLTL monitor encodings automatically. After applying equality saturation to a set of human-authored MLTL formulas, our experimental evaluation found a ~35% average monitor size reduction.

    iastate Repository record for Dynamic set reasoning: Specifying and optimizing monitor encodings (opens in a new tab)

  11. A simple proof checker for real-time systems

    … and there are few "surprises" when applying rewrite rules or decision procedures to proof obligations. A hand-written proof constructed to verify the timing correctness of a high bandwidth communication protocol was verified using this checker.

    ubc Repository record for A simple proof checker for real-time systems (opens in a new tab) Download PDF for A simple proof checker for real-time systems (opens in a new tab)

  12. ESTIMATING STUDENT KNOWLEDGE LEVELS IN AN ITS FOR PROPOSITIONAL LOGIC

    … knowl-edge levels of students on propositional rewrite rules. We will base the student model on Bayesian Knowledge Tracking, but extend the basic structure of the classical Bayesian Knowledge Tracking model. The student model will classify the difficulty level of the ex-ercises in the ITS based …

    openu Repository record for ESTIMATING STUDENT KNOWLEDGE LEVELS IN AN ITS FOR PROPOSITIONAL LOGIC (opens in a new tab) Download PDF for ESTIMATING STUDENT KNOWLEDGE LEVELS IN AN ITS FOR PROPOSITIONAL LOGIC (opens in a new tab)

  13. A linguistic method for robot verification programming and control

    … point for physical robots. We introduce a set of rewrite rules for hybrid systems and apply it automatically build a hybrid model for mobile manipulation from a semantic map. In the manipulation domain, we develop a new workspace interpolation methods which provides direct, non-stop motion through …

    gatech Repository record for A linguistic method for robot verification programming and control (opens in a new tab)

  14. Structured local exponential models for machine translation

    … probability distributions with individual rewrite rules used by the translation system, such as synchronous context-free rules, or with other individual aspects of translation hypotheses such as word pairs or reordering events. Unlike other authors we use these estimates to replace the …

    maryland Repository record for Structured local exponential models for machine translation (opens in a new tab)

  15. Formalising privacy regulations with bigraphs

    … 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 approach, …

    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)

  16. Oatlog: A high-performance e-graph engine

    … These arise from a combinatorial explosion in rewrite possibilities, requiring sophisticated e-graph engines and motivating research into e-graph technology. We introduce Oatlog, an ahead-of-time compiling e-graph engine that significantly outperforms egglog, the currently fastest mainstream …

    chalmers Repository record for Oatlog: A high-performance e-graph engine (opens in a new tab)

  17. Desenvolvimento formal de aplicações para smartcards

    … (SDF) and the code transformations through rewrite rules (ASF). This specification was an important support during the translator development and contributes to the tool documentation. We also emphasize the KitSmart library [Dut06, San12], an essential component of BSmart, containing models …

    brazil-ufrn Repository record for Desenvolvimento formal de aplicações para smartcards (opens in a new tab)

  18. Rewriting context-free families of string diagrams

    … us to formally establish equalities modulo any rewrite steps which follow from the monoidal structure.</p> <p>Manipulating string diagrams by hand is a time-consuming and error-prone process, especially for large string diagrams. This can be ameliorated by using software proof assistants, such …

    oxford Repository record for Rewriting context-free families of string diagrams (opens in a new tab)

  19. Constrained completion: Theory, implementation, and results

    … sets of reductions but can not handle certain rewrite rules such as commutativity. In order to handle such theories, completion procedure were created to find complete sets of reductions modulo an equational theory. The major problem with this method is that it requires a specialized …

    must-thes Repository record for Constrained completion: Theory, implementation, and results (opens in a new tab)

Page 1 of 2