Planning diagonalization proofs

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Proof planning [Bun91] is the search for a sequence of tactics (a proof plan)which can be applied to construct an object level proof. The used operators (methods) are specifications of tactics represented in a meta-language. A method specifies when the associated tactic can be applied and what its effects are. In our approach, we extend methods that represent well-known proof techniques, such as induction or diagonalization, with control knowledge and call them strategies.

Cite

CITATION STYLE

APA

Cheikhrouhou, L. (1997). Planning diagonalization proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1303, pp. 377–380). Springer Verlag. https://doi.org/10.1007/3540634932_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free