.png){kind=icon}
.png){kind=icon}
Return
Polite Combination in Parametric Array Theories
.png){kind=icon}
OA
AI
DOI：10.1007/978-3-032-04167-8_9.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Parametric array theories are extensions of the quantifier-free theory of arrays with relations that hold componentwise. We observe that decision procedures for the satisfiability of these theories rely on a kind of finite witnessability property. We use this insight to show the politeness of these theories with respect to the index and element sorts. Our results clarify the politeness of the theory of sets with the cardinality operator, which was left open in the literature.
Keywords:
parametric array theories
satisfiability
finite witnessability
politeness
index sort
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
0
Papers:
21
Citations:
0