Date of Award

1-1-2018

Language

English

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

College/School/Department

Department of Computer Science

Content Description

1 online resource (ix, 65 pages) : illustrations.

Dissertation/Thesis Chair

Paliath Narendran

Committee Members

Neil Murray, Christopher Lynch

Keywords

LM-systems, term rewriting, unification, Rewriting systems (Computer science), Automatic theorem proving

Subject Categories

Computer Sciences

Abstract

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.

Share

COinS