Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties
Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for computing a congruence closure by abstracting nonflat terms by const...
Main Author: | Deepak Kapur |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2023-03-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/8693/pdf |
Similar Items
-
All Linear-Time Congruences for Familiar Operators
by: Antti Valmari
Published: (2013-11-01) -
Uniform Interpolants in EUF: Algorithms using DAG-representations
by: Silvio Ghilardi, et al.
Published: (2022-04-01) -
Decreasing Diagrams for Confluence and Commutation
by: Jörg Endrullis, et al.
Published: (2020-02-01) -
A categorical framework for congruence of applicative bisimilarity in higher-order languages
by: Tom Hirschowitz, et al.
Published: (2022-09-01) -
On tractability and congruence distributivity
by: Emil Kiss, et al.
Published: (2007-06-01)