Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

2009 ◽  
Vol 92 (1-2) ◽  
pp. 145-168 ◽  
Author(s):  
Rakesh Verma
Keyword(s):  
2008 ◽  
Vol 11 (2) ◽  
Author(s):  
Andre Luiz Galdino ◽  
Mauricio Ayala Rincon

A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) called ars is described. Adequate specifications of basic definitions and notions of the theory of ARSs such as reduction, confluence and normal form are given and well-known results formalized. The formalizations include non trivial results of the theory of ARSs such as the correctness of the principle of Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemmas, among others. Although term rewriting proving technologies have been provided in several specification languages and proof assistants, to our knowledge, before the development presented in this paper there was no complete formalization of an abstract reduction theory in PVS. This makes relevant the presented ars specification as the basis of a PVStheory called trs for the general treatment of Term Rewriting Systems.


Author(s):  
A. V. Crewe

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.


Author(s):  
N.I. Gdansky ◽  
◽  
A.A. Denisov ◽  

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.


Author(s):  
David Julian Gonzalez Maldonado ◽  
Peter Hagedorn ◽  
Thiago Ritto ◽  
Rubens Sampaio ◽  
Artem Karev

Author(s):  
V. F. Edneral ◽  
O. D. Timofeevskaya

Introduction:The method of resonant normal form is based on reducing a system of nonlinear ordinary differential equations to a simpler form, easier to explore. Moreover, for a number of autonomous nonlinear problems, it is possible to obtain explicit formulas which approximate numerical calculations of families of their periodic solutions. Replacing numerical calculations with their precalculated formulas leads to significant savings in computational time. Similar calculations were made earlier, but their accuracy was insufficient, and their complexity was very high.Purpose:Application of the resonant normal form method and a software package developed for these purposes to fourth-order systems in order to increase the calculation speed.Results:It has been shown that with the help of a single algorithm it is possible to study equations of high orders (4th and higher). Comparing the tabulation of the obtained formulas with the numerical solutions of the corresponding equations shows good quantitative agreement. Moreover, the speed of calculation by prepared approximating formulas is orders of magnitude greater than the numerical calculation speed. The obtained approximations can also be successfully applied to unstable solutions. For example, in the Henon — Heyles system, periodic solutions are surrounded by chaotic solutions and, when numerically integrated, the algorithms are often unstable on them.Practical relevance:The developed approach can be used in the simulation of physical and biological systems.


Sign in / Sign up

Export Citation Format

Share Document