Results 1  10
of
313,413
The Matita Interactive Theorem Prover
"... Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Interactive theorem proving with tasks
 Electronic Notes in Theoretical Computer Science 103 (2004
, 2004
"... Interactive theorem proving systems for mathematics require user interfaces which allow for user interaction that is as natural as possible. However, this interaction is often limited by the traditional calculi underlying most theorem proving systems. This is particularly problematic with respect to ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Interactive theorem proving systems for mathematics require user interfaces which allow for user interaction that is as natural as possible. However, this interaction is often limited by the traditional calculi underlying most theorem proving systems. This is particularly problematic with respect
The knowledge complexity of interactive proof systems
 in Proc. 27th Annual Symposium on Foundations of Computer Science
, 1985
"... Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltoni ..."
Abstract

Cited by 1267 (42 self)
 Add to MetaCart
Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian
Exploiting Parallelism in Interactive Theorem Provers
 Proceedings of TPHOLs, volume 1479 of LNCS
, 1998
"... . This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a co ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multiprocessor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a
Automated and Interactive Theorem Proving
"... The idea of mechanizing reasoning is an old dream that can be traced at least back to Leibniz. Since about 1950, there has been considerable research on having computers perform logical reasoning, either completely autonomously (automated theorem proving) or in cooperation with a person (interactiv ..."
Abstract
 Add to MetaCart
The idea of mechanizing reasoning is an old dream that can be traced at least back to Leibniz. Since about 1950, there has been considerable research on having computers perform logical reasoning, either completely autonomously (automated theorem proving) or in cooperation with a person (interactive
Excitatory and inhibitory interactions in localized populations of model
 Biophysics
, 1972
"... ABSMAcr Coupled nonlinear differential equations are derived for the dynamics of spatially localized populations containing both excitatory and inhibitory model neurons. Phase plane methods and numerical solutions are then used to investigate population responses to various types of stimuli. The res ..."
Abstract

Cited by 491 (11 self)
 Add to MetaCart
ABSMAcr Coupled nonlinear differential equations are derived for the dynamics of spatially localized populations containing both excitatory and inhibitory model neurons. Phase plane methods and numerical solutions are then used to investigate population responses to various types of stimuli. The results obtained show simple and multiple hysteresis phenomena and limit cycle activity. The latter is particularly interesting since the frequency ofthe limit cycle oscillationis found to be a monotonic function of stimulus intensity. Finally, it is proved that the existence of limit cycle dynamics in response to one class of stimuli implies the existence of multiple stable states and hysteresis in response to a different class of stimuli. The relation between these findings and a number of experiments is discussed.
An Interactive Theorem Proving Assistant
, 1999
"... . This paper describes WinKE, an interactive proof assistant, which is based on the KE calculus. The software has been designed to serve as a tutoring system supporting the teaching of logic and theorem proving through KE. 1 Introduction The KE calculus [4] is a refutation system close to the c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This paper describes WinKE, an interactive proof assistant, which is based on the KE calculus. The software has been designed to serve as a tutoring system supporting the teaching of logic and theorem proving through KE. 1 Introduction The KE calculus [4] is a refutation system close
Interactive Theorem Proving in Twelf
"... In recent work, we showed how to implement tacticstyle theorem proving in Twelf [2]. Tactics and tacticals are a mechanism used in a variety of theorem provers such as LCF [5], HOL [4], and Coq [8]. They provide
exible control for goaldirected proof search. Tactics provide the basic search proced ..."
Abstract
 Add to MetaCart
In recent work, we showed how to implement tacticstyle theorem proving in Twelf [2]. Tactics and tacticals are a mechanism used in a variety of theorem provers such as LCF [5], HOL [4], and Coq [8]. They provide
exible control for goaldirected proof search. Tactics provide the basic search
Results 1  10
of
313,413