Uniform Interpolants in EUF: Algorithms using DAG-representations
The concept of uniform interpolant for a quantifier-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the formal methods and automated reasoning community for a long time. This concept is precisely defined. Two algorithms for comp...
Main Authors: | Silvio Ghilardi, Alessandro Gianola, Deepak Kapur |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-04-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/7257/pdf |
Similar Items
-
Quantifier-Free Interpolation of a Theory of Arrays
by: Roberto Bruttomesso, et al.
Published: (2012-04-01) -
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties
by: Deepak Kapur
Published: (2023-03-01) -
On Interpolation and Symbol Elimination in Theory Extensions
by: Viorica Sofronie-Stokkermans
Published: (2018-09-01) -
Definability and Interpolation within Decidable Fixpoint Logics
by: Michael Benedikt, et al.
Published: (2019-09-01) -
Feasible Interpolation for QBF Resolution Calculi
by: Olaf Beyersdorff, et al.
Published: (2017-06-01)