Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:www.ideals.illinois.edu:2142/78008

Order-Sorted Rewriting and Congruence Closure

Authors
Publication date
4 June 2015
Publisher

Abstract

Order-sorted type systems supporting inheritance hierarchies and subtype polymorphism are used in theorem proving, AI, and declarative programming. The satisfiability problems for the theories of: (i) order-sorted uninterpreted function symbols, and (ii) of such symbols modulo a subset of associative-commutative ones are reduced to the unsorted versions of such problems at no extra computational cost. New results on order-sorted rewriting are needed to achieve this reduction.Partially supported by NSF Grant CNS 13-19109.Ope

Similar works

Full text

thumbnail-image

Illinois Digital Environment for Access to Learning and Scholarship Repository

redirect
oaioai:www.ideals.illinois.edu:21...
Last time updated on 11/06/2018

This paper was published in Illinois Digital Environment for Access to Learning and Scholarship Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.