On two-variable guarded fragment logic with expressive local Presburger constraints
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917766714359808 |
|---|---|
| author | Lu, Chia-Hsuan Tan, Tony |
| author_facet | Lu, Chia-Hsuan Tan, Tony |
| contents | We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at most three times the number of incoming green edges" and captures various description logics with counting, but without constant symbols. We show that the satisfiability problem for this logic is EXP-complete. While the lower bound already holds for the standard two-variable guarded fragment logic, the upper bound is established by a novel, yet simple deterministic graph-based algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_13731 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On two-variable guarded fragment logic with expressive local Presburger constraints Lu, Chia-Hsuan Tan, Tony Logic in Computer Science We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at most three times the number of incoming green edges" and captures various description logics with counting, but without constant symbols. We show that the satisfiability problem for this logic is EXP-complete. While the lower bound already holds for the standard two-variable guarded fragment logic, the upper bound is established by a novel, yet simple deterministic graph-based algorithm. |
| title | On two-variable guarded fragment logic with expressive local Presburger constraints |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2206.13731 |