Automated Proof Construction in Type Theory Using Resolution

@article{Bezem2002AutomatedPC,
  title={Automated Proof Construction in Type Theory Using Resolution},
  author={Marc Bezem and Dimitri Hendriks and Hans de Nivelle},
  journal={Journal of Automated Reasoning},
  year={2002},
  volume={29},
  pages={253-275}
}
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. • A clausification procedure in type theory, equipped with a correctness proof, all encoded using higher-order primitive recursion. • A novel representation of clauses in minimal logic such that the λ-representation of resolution steps is linear in the size of the premisses. • A translation of resolution proofs into lambda terms, yielding a verification procedure for those… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Certifying Term Rewriting Proofs in ELAN

Electr. Notes Theor. Comput. Sci. • 2001
View 1 Excerpt

Proof reflection in Coq. Number 28 in Artificial Intelligence

D. Hendriks
Preprint Series, Dept. of Philosophy, Utrecht University, • 2001

Logik und das Auswahlaxiom

B. Günzel
Diplomarbeit, Fakultät für Mathematik und Informatik der Ludwig-Maximilians-Universität München, • 2000
View 1 Excerpt

The CADE-16 ATP System Competition

Journal of Automated Reasoning • 2000
View 1 Excerpt

Clausification of First-Order Formulae, Representation & Correctness in Type Theory

D. Hendriks
Master Thesis, Utrecht University, • 1998

Similar Papers

Loading similar papers…