183 search results - page 25 / 37 » Automated theorem proving by resolution in non-classical log... |
CADE
1990
Springer
13 years 11 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
LPAR
2001
Springer
13 years 12 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...