On the Dynamic Increase of Multiplicities in Matrix Proof Methods for Classical Higher-Order Logic
A major source of the undecidability of a logic is the number of instances—the so-called multiplicities—of existentially quantified formulas that are required in a proof. We consider the problem in the context of matrix proof methods for classical higher-order logic and present a technique which improves the standard practice of iterative deepening over the multiplicities. We present a mechanism that allows to adjust multiplicities on demand during matrix-based proof search and not only preserves existing substitutions and connections, but additionally adapts them to the parts that result from the increase of the multiplicities.
KeywordsModal Logic Proof Search Expansion Tree Extensionality Rule Secondary Type
Unable to display preview. Download preview PDF.
- 3.Autexier, S.: Hierarchical Contextual Reasoning. PhD thesis, Computer Science Department, Saarland University, Saarbrücken, Germany (2003)Google Scholar
- 8.Issar, S.: Path-focused duplication: A search procedure for general matings. In: Dietterich, T.S.W. (ed.) Proceedings of the 8th National Conference on Artificial Intelligence (AAAI 90), Menlo Park - Cambridge - London, July 1990, vol. 1, pp. 221–226. AAAI Press / MIT Press (1990)Google Scholar
- 9.Miller, D.A.: Proofs in Higher-Order Logic. Phd thesis, Carnegie Mellon University (1983)Google Scholar
- 10.Pfenning, F.: Proof Transformation in Higher-Order Logic. Phd thesis, Carnegie Mellon University (1987)Google Scholar
- 12.Wallen, L.: Automated proof search in non-classical logics: efficient matrix proof methods for modal and intuitionistic logics. MIT Press series in artificial intelligence (1990)Google Scholar