Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.21986 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918248573829120 |
|---|---|
| author | Takahata, Kanta Schöpf, Jonas Nishida, Naoki Aoto, Takahito |
| author_facet | Takahata, Kanta Schöpf, Jonas Nishida, Naoki Aoto, Takahito |
| contents | Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained term rewriting. A fundamental question on constrained terms arising there is how to characterize equivalence between them. However, in the current literature only limited progress has been made on this. In this paper, we provide several sound and complete solutions to tackle this problem. Our key idea is the introduction of a novel concept, namely existentially constrained terms, into which the original form of constrained terms can be embedded. We present several syntactic characterizations of equivalence between existentially constrained terms. In particular, we provide two different kinds of complete characterizations: one is designed to facilitate equivalence checking, while the other is intended for theoretical analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_21986 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version) Takahata, Kanta Schöpf, Jonas Nishida, Naoki Aoto, Takahito Logic in Computer Science Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained term rewriting. A fundamental question on constrained terms arising there is how to characterize equivalence between them. However, in the current literature only limited progress has been made on this. In this paper, we provide several sound and complete solutions to tackle this problem. Our key idea is the introduction of a novel concept, namely existentially constrained terms, into which the original form of constrained terms can be embedded. We present several syntactic characterizations of equivalence between existentially constrained terms. In particular, we provide two different kinds of complete characterizations: one is designed to facilitate equivalence checking, while the other is intended for theoretical analysis. |
| title | Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2505.21986 |