Automated Proof Construction in Type Theory using Resolution

Bezem, Marc; Hendriks, Dimitri; de Nivelle, Hans

Local TagsRelease HistoryDetailsSummary

Automated Proof Construction in Type Theory using Resolution

Bezem, M., Hendriks, D., & de Nivelle, H. (2002). Automated Proof Construction in Type Theory using Resolution. Journal of Automated Reasoning, 29, 253-275.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F21-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F22-C

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bezem, Marc, Author
Hendriks, Dimitri, Author
de Nivelle, Hans¹, Author

Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

hide

Free keywords: -

Abstract: We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows: {\bf (1)}. A clausification procedure in type theory, equipped with a correctness proof, all encoded using higher-order primitive recursion. {\bf (2)}. A novel representation of clauses in minimal logic such that the $ \lambda $-representation of resolution steps is linear in the size of the premisses. {\bf (3)}. Availability of the power of resolution theorem provers in interactive proof construction systems based on type theory.

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-09-01Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202121
Other: Local-ID: C1256104005ECAFC-B231DAC4BCC58595C1256D090040A825-deNivelle2002b

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Automated Reasoning

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 29 Sequence Number: - Start / End Page: 253 - 275 Identifier: ISSN: 0168-7433