Combinatory Array Logic with Sums
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911860989624320 |
|---|---|
| author | Raya, Rodrigo |
| author_facet | Raya, Rodrigo |
| contents | We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragments in the literature in terms of their expressiveness and computational complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_06582 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Combinatory Array Logic with Sums Raya, Rodrigo Logic in Computer Science We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragments in the literature in terms of their expressiveness and computational complexity. |
| title | Combinatory Array Logic with Sums |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2311.06582 |