The Complexity of Resource-Bounded First-Order Classical Logic

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.

[1]  Paliath Narendran,et al.  Double-exponential complexity of computing a complete set of AC-unifiers , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2]  Dexter Kozen.  Communication: Positive First-Order Logic is NP-Complete , 1981, IBM J. Res. Dev..

[3]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[4]  Patrick Lincoln,et al.  Constant-Only Multiplicative Linear Logic is NP-Complete , 1992, Theor. Comput. Sci..

[5]  Harry R. Lewis,et al.  Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[6]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[7]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[8]  Jean Goubault.  Demonstration automatique en logique classique : complexite et methodes , 1993 .

[9]  Michel Minoux,et al.  LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..

[10]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[11]  Rohit Parikh.  Some results on the length of proofs , 1973 .

[12]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[13]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[14]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[15]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[16]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[17]  Warren D. Goldfarb,et al.  The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..

[18]  Yuri Gurevich.  On the Classical Desicion Problem , 1990, Bull. EATCS.

[19]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[20]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[21]  Paliath Narendran,et al.  Matching, unification and complexity , 1987, SIGS.

[22]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[23]  Alonzo Church,et al.  Correction to A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[24]  Elmar Eder,et al.  Relative complexities of first order calculi , 1992, Artificial intelligence = Künstliche Intelligenz.

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[27]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.