1410 search results - page 3 / 282 » Proving theorems by reuse |
TPHOL
2002
IEEE
14 years 2 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
EACL
1989
ACL Anthology
13 years 11 months ago
1989
ACL Anthology
CT Feature Unification can be integrated with Lambek Theorem Proving in a simple and straightforward way. Two principles determine all distribution of features in LTP. It is not ne...
AMAI
2007
Springer
13 years 10 months ago
2007
Springer
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
IANDC
1998
13 years 9 months ago
1998
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...