Results 1  10
of
164,044
The ALF proof editor
 In Proceedings of the Workshop on Types for Proofs and Programs
, 1993
"... Alf is an interactive proof editor. It is based on the idea that to prove a mathematical theorem is to build a proof object for the theorem. The proof object is directly manipulated on the screen, different manipulations correspond to different steps in the proof. The language we use is MartinLof&a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Alf is an interactive proof editor. It is based on the idea that to prove a mathematical theorem is to build a proof object for the theorem. The proof object is directly manipulated on the screen, different manipulations correspond to different steps in the proof. The language we use is Martin
Dialogue Systems as Proof Editors
 Journal of Logic, Language and Information
, 2001
"... This paper shows how a dialogue system for informationseeking dialogues can be implemented in a typetheorybased syntax editor, originally developed for editing mathematical proofs. The implementation gives a simple logical metatheory to such dialogue systems and also suggests new functions to the ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
This paper shows how a dialogue system for informationseeking dialogues can be implemented in a typetheorybased syntax editor, originally developed for editing mathematical proofs. The implementation gives a simple logical metatheory to such dialogue systems and also suggests new functions
The design and implementation of the grape graphical proof editor
 Master’s Project Report, TU Dresden. Available at http://grape.sourceforge.net/grape.pdf
, 2006
"... We present GraPE, a graphical proof editor that strives to provide a unified pointandclick interface for a variety of existing theorem provers and supports advanced proof editing features. It strictly separates the graphical user interface responsible for displaying the derivation being worked on ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present GraPE, a graphical proof editor that strives to provide a unified pointandclick interface for a variety of existing theorem provers and supports advanced proof editing features. It strictly separates the graphical user interface responsible for displaying the derivation being worked
PESCA — A Proof Editor for Sequent Calculus
, 2000
"... Abstract. PESCA is a program that helps in the construction of proofs in sequent calculus. It works both as a proof editor and as an automatic theorem prover. Proofs constructed in PESCA can both be seen on the terminal and printed into LATEX files. The user of PESCA can choose among different versi ..."
Abstract
 Add to MetaCart
Abstract. PESCA is a program that helps in the construction of proofs in sequent calculus. It works both as a proof editor and as an automatic theorem prover. Proofs constructed in PESCA can both be seen on the terminal and printed into LATEX files. The user of PESCA can choose among different
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higherorder judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logicindependent tools such as proof editors and proof checkers
PVS: A Prototype Verification System
 CADE
, 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract

Cited by 654 (16 self)
 Add to MetaCart
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 509 (2 self)
 Add to MetaCart
proving or modelchecking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Results 1  10
of
164,044