Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

University at Albany, State University of New York

2018

Rewriting systems (Computer science)

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

On Lm-Systems And Forward Closed String Rewriting Systems, Daniel Hono Jan 2018

On Lm-Systems And Forward Closed String Rewriting Systems, Daniel Hono

Legacy Theses & Dissertations (2009 - 2024)

The E-Unification problem appears in important application areas, e.g. automated deduction and cryptographic protocol analysis. As E-Unification is undecidable in general, there is an active search for decidable and, ideally, tractable instances of the problem.


Asymmetric Unification And Disunification, Veena Ravishankar Jan 2018

Asymmetric Unification And Disunification, Veena Ravishankar

Legacy Theses & Dissertations (2009 - 2024)

We compare two kinds of unification problems: asymmetric unification and disunification, which are variants of equational unification. Asymmetric unification is a type of equational unification where the solutions keep the right-hand sides of the equations in normal form with respect to the given term rewriting system. In disunification we solve equations and disequations with respect to an equational theory. We contrast the time complexities and decidability of both and show that the two problems are incomparable: there are theories where one is decidable whereas the other is undecidable; for theories which are decidable we show one can be solved in …


On Problems Dual To Unification : The String-Rewriting Case, Zumrut Akcam Kibis Jan 2018

On Problems Dual To Unification : The String-Rewriting Case, Zumrut Akcam Kibis

Legacy Theses & Dissertations (2009 - 2024)

Unification, with or without background theories such as associativity and commutativity,