Document Type

Report

Date

12-1990

Embargo Period

5-1-2012

Keywords

semantics

Language

English

Disciplines

Computer Sciences

Description/Abstract

This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination. It is shown that the approach used by Fitting [5] for Prolog-style logic programs is applicable in this context. A monotone operator is developed, whose fixpoints describe the semantics of conditional rewriting. Several examples illustrate this semantics for non-terminating rewrite systems which could not be easily handled by previous approaches.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-90-38

Source

local


Download

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.