Deciding the E+-class by an a posteriori, liftable order

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 219-232

  De Nivelle, Hans ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Decidable classes; Theorem proving

Indexed keywords

EID: 0346438615     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00013-0     Document Type: Article

References (17)

1. E. Börger, E. Grädel, Y. Gurevich, The Classical Decision Problem, Springer, Berlin, 1996.
2. C.-L. Chang, R.C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
3. B. Dreben, W.D. Goldfarb, The Decision Problem, Solvable Classes of Quantificational Formulas, Addision-Wesley, Reading, MA, 1979.
4. C. Fermüller, A. Leitsch, T. Tammet, N. Zamov, Resolution Methods for the Decision Problem, Lecture Notes in Artificial Intelligence, Vol. 679, Springer, Berlin, 1993.
5. W.H. Joyner, Resolution strategies as decision procedures, J. Association for Computing Machinery 23 (1) (1976) 398-417.
6. A. Leitsch, The Resolution Calculus, Springer, Berlin, 1997.
7. S. Yu. Maslov, Theory of Deductive Systems and its Applications, The MIT Press, Cambridge, MA, London, England, 1986 (transl. M. Gelfond, V. Lifschitz).
8. W.W. McCune, Otter 3.0 Reference Manual and Guide, Argonne National Laboratory, Mathematics and Computer Science Division, can be obtained from ftp.mcs.anl.gov, directory pub/Otter, 1995.
9. G. Mints, Gentzen-type systems and resolution rules, Part 1, Propositional logic, in: COLOG-88, International Conference on Computational Logic, Talinn (at that time) USSR, 1988.
10. H. de Nivelle, Application of resolution games to resolution decision procedures, Internal Report 94-50, Department of Mathematics and Computer Science, Delft University of Technology, 1994.
11. H. de Nivelle, Resolution games and non-liftable resolution orderings, in: CSL94, Springer, Berlin, 1994, pp. 279-293.
12. H. de Nivelle, Deciding the E+-class by an a posteriori, liftable order, Internal Report of the ILLC, ML-1998-03, 1998.
13. H. de Nivelle, A resolution decision procedure for the guarded fragment, in: C. Kirchner, H. Kirchner (Eds.), Computer Aided Deduction-15, Springer, Berlin, 1998, pp. 191-204.
14. J.A. Robinson, A machine oriented logic based on the resolution principle, J. Association for Computing Machinery 12 (1965) 23-41.
15. T. Tammet, The resolution program, able to decide some solvable classes, in: COLOG-88, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 300-312.
16. C. Weidenbach, (Max-Planck-Institut für Informatik), The Spass & Flotter Users Guide, Version 0.55, can be obtained from ftp.mpi-sb.mpg.de, directory pub/SPASS, 1997.
17. N.K. Zamov, On a bound for the complexity of terms in the resolution method, Trudy Mat. Inst. Steklov 121 (1972) 1-10.