English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Narrowing strategies for arbitrary canonical systems

Bockmayr, A., Krischer, S., & Werner, A. (1995). Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 24(1,2), 125-155.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bockmayr, Alexander1, Author           
Krischer, Stefan, Author
Werner, Andreas, Author
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: Narrowing is a universal unification procedure for equational theories defined by a canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for arbitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowing. LSE narrowing is complete and improves all other strategies which are complete for arbitrary canonical systems. It is optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. Moreover, LSE narrowing computes only normalized narrowing substitutions.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519597
Other: Local-ID: C1256104005ECAFC-B724B40F27995AF9C125614400620E4B-BockmayrKrischerWerner94
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Fundamenta Informaticae
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 24 (1,2) Sequence Number: - Start / End Page: 125 - 155 Identifier: ISSN: 0169-2968