Sciweavers

183 search results - page 4 / 37
» Automated theorem proving by resolution in non-classical log...
Sort
View
CADE
2001
Springer
14 years 8 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...
TPHOL
1999
IEEE
13 years 12 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
SARA
2007
Springer
14 years 1 months ago
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
Timothy L. Hinrichs
CADE
1998
Springer
13 years 12 months ago
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
Jacques D. Fleuriot, Lawrence C. Paulson
TABLEAUX
2005
Springer
14 years 1 months ago
The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...
Thomas Raths, Jens Otten, Christoph Kreitz