Automated complexity analysis based on ordered resolution

Journal of the ACM

Volumn 48, Issue 1, 2001, Pages 70-109

  Basin, David ^a   Ganzinger, Harald ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Automated theorem proving; Complexity analysis; First order theories; Ordered resolution

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

AUTOMATED THEOREM PROVING; COMPLEXITY ANALYSIS; FIRST-ORDER THEORIES; HORN CLAUSES; ORDERED RESOLUTION;

COMPUTATIONAL COMPLEXITY;

EID: 0001987904     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/363647.363681     Document Type: Article

References (13)

1. BACHMAIR, L., AND GANZINGER, H. 1990. On restrictions of ordered paramodulation with simplification. In Proceedings of the 10th International Conference on Automated Deduction, Kaiserslautern. M. Stickel, Ed., Lecture Notes in Computer Science (Berlin, Germany), Springer-Verlag, New York, pp. 427-441.
2. BACHMAIR, L., AND GANZINGER, H. 1994a. Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4, 3, 217-247.
3. BACHMAIR, L., AND GANZINGER, H. 1994b. Rewrite techniques for transitive relations. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, Calif., pp. 384-393.
4. BACHMAIR, L., AND GANZINGER, H. 2001. Resolution theorem proving. In Handbook of Automated Reasoning. Elsevier-North Holland, Amsterdam, The Netherlands.
5. DOWLING, W., AND GALLIER, J. 1984. Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Prog. 3, 267-284.
6. GANZINGER, H., NIEUWENHUIS, R., AND NIVELA, P. 1994. The Saturate system. User manual maintained on the Web at http://www.mpi-sb.mpg.de/SATURATE/.
7. GIVAN, R., AND MCALLESTER, D. 1992. New results on local inference relations. In Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR-92) (Oct.). Morgan-Kaufmann, San Francisco, Calif., pp. 403-412.
8. HOFBAUER, D., AND LAUTEMANN, C. 1989. Termination proofs and the length of derivations. In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, N. Dershowitz, Ed. Lecture Notes in Computer Science, vol. 355. Springer-Verlag, New York, pp. 167-177.
9. KNUTH, D. E., AND BENDIX, P. B. 1970. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra (Oxford, England). J. Leech Ed. Pergamon Press, pp. 263-297.
10. MCALLESTER, D. A. 1993. Automatic recognition of tractability in inference relations. J. ACM 40, 2 (April), 284-303.
11. NEBEL, B., AND BÜRCKERT, H.-J. 1995. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. J. ACM 42, 1, 43-66.
12. NIEUWENHUIS, R. 1993. Simple LPO constraint solving methods. Inf. Proc. Lett. 47, 2 (Aug.), 65-69.
13. NIVELA, P., AND NIEUWENHUIS, R. 1993. Saturation of first-order (constrained) clauses with the Saturate system. In Rewriting Techniques and Applications, 5th International Conference, RTA-93, C. Kirchner, Ed., Lecture Notes in Computer Science (Montreal, Ont., Canada, June 16-18), pp. 436-440. Springer-Verlag.