The Complexity of Resource-Bounded First-Order Classical Logic (1994)
| Venue: | 11th Symposium on Theoretical Aspects of Computer Science |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Goubault94thecomplexity,
author = {Jean Goubault},
title = {The Complexity of Resource-Bounded First-Order Classical Logic},
booktitle = {11th Symposium on Theoretical Aspects of Computer Science},
year = {1994},
pages = {59--70},
publisher = {Springer Verlag LNCS}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We give a finer analysis of the difficulty of proof search in classical first-order logic, other than just saying that it is undecidable. To do this, we identify several measures of difficulty of theorems, which we use as resource bounds to prune infinite proof search trees. In classical first-order logic without interpreted symbols, we prove that for all these measures, the search for a proof of bounded difficulty (i.e, for a simple proof) is \Sigma p 2 -complete. We also show that the same problem when the initial formula is a set of Horn clauses is only NP-complete, and examine the case of first-order logic modulo an equational theory. These results allow us not only to give estimations of the inherent difficulty of automated theorem proving problems, but to gain some insight into the computational relevance of several automated theorem proving methods. Topics: computational complexity, logics, computational issues in AI (automated theorem proving). 1 Introduction First-order ...
