On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2007
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916212611481600 |
|---|---|
| author | Pratt-Hartmann, Ian |
| author_facet | Pratt-Hartmann, Ian |
| contents | In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0701039 |
| institution | arXiv |
| publishDate | 2007 |
| record_format | arxiv |
| spellingShingle | On the Complexity of the Numerically Definite Syllogistic and Related Fragments Pratt-Hartmann, Ian Logic in Computer Science Artificial Intelligence Computational Complexity F.4.1 In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics. |
| title | On the Complexity of the Numerically Definite Syllogistic and Related Fragments |
| topic | Logic in Computer Science Artificial Intelligence Computational Complexity F.4.1 |
| url | https://arxiv.org/abs/cs/0701039 |