Technical Reports (CIS)

Document Type

Technical Report

Subject Area

GRASP

Date of this Version

January 1988

Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-88-07.

Abstract

In this paper, an algorithm for testing the unsatisfiability of a set of ground order-sorted equational Horn clauses (for coherent signatures) is presented. This result follows from the fact that the concept of congruence closure extends to finite sets of ground order-sorted equational Horn clauses. We show how to compute the order-sorted congruence closure and obtain an algorithm running in O2).

Share

COinS
 

Date Posted: 01 November 2007