Withdraw
Loading…
Order-Sorted Rewriting and Congruence Closure
Meseguer, José
Content Files

Loading…
Download Files
Loading…
Download Counts (All Files)
Loading…
Edit File
Loading…
Permalink
https://hdl.handle.net/2142/78008
Description
- Title
- Order-Sorted Rewriting and Congruence Closure
- Author(s)
- Meseguer, José
- Issue Date
- 2015-06-04
- Keyword(s)
- order-sorted rewriting, congruence closure, satisfiability
- Date of Ingest
- 2015-06-05T18:16:13Z
- 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.
- Type of Resource
- text
- Genre of Resource
- Technical Report
- Language
- en
- Permalink
- http://hdl.handle.net/2142/78008
- Sponsor(s)/Grant Number(s)
- Partially supported by NSF Grant CNS 13-19109.
Owning Collections
Manage Files
Loading…
Edit Collection Membership
Loading…
Edit Metadata
Loading…
Edit Properties
Loading…
Embargoes
Loading…