Results 1  10
of
23
leanCoP: Lean ConnectionBased Theorem Proving
 UNIVERSITY OF KOBLENZ
, 2000
"... The Prolog program "prove(M,I) : append(Q,[CR],M), "+member(,C), append(Q,R,S), prove([!],[[!C]S],[],I). prove([],,,). prove([LC],M,P,I) : (N=L; L=N) ? (member(N,P); append(Q,[DR],M), copyterm(D,E), append(A,[NB],E), append(A,B,F), (D==E ? append(R,Q,S); len ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
The Prolog program "prove(M,I) : append(Q,[CR],M), "+member(,C), append(Q,R,S), prove([!],[[!C]S],[],I). prove([],,,). prove([LC],M,P,I) : (N=L; L=N) ? (member(N,P); append(Q,[DR],M), copyterm(D,E), append(A,[NB],E), append(A,B,F), (D==E ? append(R,Q,S); length(P,K), K!I, append(R,[DQ],S)), prove(F,S,[LP],I)), prove(C,M,P,I)." implements a theorem prover for classical firstorder (clausal) logic which is based on the connection calculus. It is sound, complete (if one more line is added), and demonstrates a comparatively strong performance.
Clausal ConnectionBased Theorem Proving in Intuitionistic FirstOrder Logic
 In B. Beckert, Ed., TABLEAUX 2005, LNAI 3702
, 2005
"... Abstract. We present a clausal connection calculus for firstorder intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, whi ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We present a clausal connection calculus for firstorder intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, which we prove correct and complete. The calculus was implemented by extending the classical prover leanCoP. We present some details of the implementation, called ileanCoP, and experimental results. 1
MetaPRL  A Modular Logical Environment
, 2003
"... MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive LCFstyle tacticbased proof assistant, a logical framework, a logical programming environment, and a formal methods programming toolkit. MetaPRL is distributed under an opensource license and can be downloaded from http://metaprl.org/. This paper provides an overview of the system focusing on the features that did not exist in the previous generations of PRL systems.
ConnectionBased Proof Search in Propositional BI Logic
 In 18th Int
, 2002
"... We present a connectionbased characterization of propositional BI (logic of bunched implications), a logic combining linear and intuitionistic connectives. This logic, with its sharing interpretation, has been recently used to reason about mutable data structures and needs proof search methods. Our ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We present a connectionbased characterization of propositional BI (logic of bunched implications), a logic combining linear and intuitionistic connectives. This logic, with its sharing interpretation, has been recently used to reason about mutable data structures and needs proof search methods. Our connectionbased characterization for BI is based on standard notions but involves, in a specic way, labels and constraints in order to capture the interactions between connectives during the proofsearch. As BI is conservative w.r.t. intuitionistic logic and multiplicative intuitionistic linear logic, we deduce, by some restrictions, new connectionbased characterizations and methods for both logics.
JProver: Integrating connectionbased theorem proving into interactive proof assistants
 IJCAR’01, volume 2083 of LNAI
, 2001
"... Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objec ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objects, and its integration into the Nuprl proof development system. 1
Connectiondriven inductive theorem proving
 Studia Logica
"... Abstract. We present a method for integrating ripplingbased rewriting into matrixbased theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present a method for integrating ripplingbased rewriting into matrixbased theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverserippling heuristic. Conditional substitutions are generated whenever a uniform substitution is impossible. We illustrate the integrated method by discussing several inductive proofs for the integer square root problem as well as the algorithms extracted from these proofs.
FDL: A prototype formal digital library. PostScript document on website
, 2002
"... Digital Library (FDL). We designed the system and assembled the prototype as part of a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Digital Library (FDL). We designed the system and assembled the prototype as part of a
Proofsearch and proof nets in mixed linear logic
 Electronic Notes in Theoretical Computer Science
"... ..."
(Show Context)