Logical syntax and computational complexity
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 101-115
- https://doi.org/10.1007/bfb0099481
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of the satisfiability problem for Krom formulasTheoretical Computer Science, 1984
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- Alternation and the computational complexity of logic programsThe Journal of Logic Programming, 1984
- Complexity classes and theories of finite modelsTheory of Computing Systems, 1981
- Low level complexity for combinatorial gamesPublished by Association for Computing Machinery (ACM) ,1981
- Embedded implicational dependencies and their inference problemPublished by Association for Computing Machinery (ACM) ,1981
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971