Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2006
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917643864244224 |
|---|---|
| author | Pratt-Hartmann, Ian |
| author_facet | Pratt-Hartmann, Ian |
| contents | We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y. Kazakov, that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0601112 |
| institution | arXiv |
| publishDate | 2006 |
| record_format | arxiv |
| spellingShingle | Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers Pratt-Hartmann, Ian Logic in Computer Science Computational Complexity We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y. Kazakov, that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. |
| title | Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers |
| topic | Logic in Computer Science Computational Complexity |
| url | https://arxiv.org/abs/cs/0601112 |