One-Dimensional Fragment over Words and Trees
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909161212608512 |
|---|---|
| author | Kieronski, Emanuel Kuusisto, Antti |
| author_facet | Kieronski, Emanuel Kuusisto, Antti |
| contents | One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a complete classification of the complexity of its satisfiability problem for various navigational signatures, and comparing its expressive power with other important formalisms. These include the two-variable fragment with counting and the unary negation fragment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2110_02678 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | One-Dimensional Fragment over Words and Trees Kieronski, Emanuel Kuusisto, Antti Logic in Computer Science One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a complete classification of the complexity of its satisfiability problem for various navigational signatures, and comparing its expressive power with other important formalisms. These include the two-variable fragment with counting and the unary negation fragment. |
| title | One-Dimensional Fragment over Words and Trees |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2110.02678 |