Results 1  10
of
10
E  A Brainiac Theorem Prover
, 2002
"... We describe the superpositionbased theorem prover E. E is a sound and complete... ..."
Abstract

Cited by 126 (18 self)
 Add to MetaCart
We describe the superpositionbased theorem prover E. E is a sound and complete...
2001b, ‘The CADE17 ATP System Competition
 Journal of Automated Reasoning
"... Abstract. The results of the IJCAR ATP System Competition are presented. ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
Abstract. The results of the IJCAR ATP System Competition are presented.
An Evaluation of Shared Rewriting
 PROCEEDINGS OF THE SECOND INTERNATIONAL WORKSHOP ON IMPLEMENTATION OF LOGICS, TECHNICAL REPORT MPII20012006
, 2001
"... We present an experimental study on the use of shared rewriting in equational theorem proving. We identify the main effects that lead to term sharing in the proof state and experimentally show their influence. Besides the ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We present an experimental study on the use of shared rewriting in equational theorem proving. We identify the main effects that lead to term sharing in the proof state and experimentally show their influence. Besides the
Proceedings of the CADE23 ATP System Competition CASC23
"... The CADE ATP System Competition (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The CADE ATP System Competition (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bounded number of eligible problems chosen from the TPTP problem library, and specified time limits on solution attempts. The CADE23 ATP System Competition (CASC23) was held on 3rd August 2011. The design of the competition and its rules, and information regarding the competing systems, are provided in this report. 1
The CADE22 ATP System Competition (CASC22)
"... The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bo ..."
Abstract
 Add to MetaCart
The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bounded number of eligible problems chosen from the TPTP problem library, and a specified time limit for each solution attempt. The CADE22 ATP System Competition (CASC22) was held on 5th August 2009. The design of the competition and it’s rules, and information regarding the competing systems, are provided in this report. 1
Proceedings of the 5th IJCAR ATP System Competition CASCJ5
"... The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bo ..."
Abstract
 Add to MetaCart
The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bounded number of eligible problems chosen from the TPTP problem library, and specified time limits on solution attempts. The 5th IJCAR ATP System Competition (CASCJ5) was held on 17th July 2008. The design of the competition and it’s rules, and information regarding the competing systems, are provided in this report. 1
On the ChurchRosser and Coherence Properties of Conditional OrderSorted Rewrite Theories 1
"... In the effort to bring rewritingbased methods into contact with practical applications both in programing and in formal verification, there is a tension between: (i) expressiveness and generality—so that a wide range of applications can be expressed easily and naturally—, and (ii) support for forma ..."
Abstract
 Add to MetaCart
In the effort to bring rewritingbased methods into contact with practical applications both in programing and in formal verification, there is a tension between: (i) expressiveness and generality—so that a wide range of applications can be expressed easily and naturally—, and (ii) support for formal verification, which is harder to get for general and expressive specifications. This paper answers the challenge of successfully negotiating the tension between goals (i) and (ii) for a wide class of quite expressive Maude specifications, namely: (a) equational ordersorted conditional specifications (Σ, E ∪ A), corresponding to functional programs modulo axioms such as associativity and/or commutativity and/or identity; and (b) ordersorted conditional rewrite theories R = (Σ, E ∪ A, R, φ), corresponding to concurrent programs modulo axioms A. For functional programs the key formal property checked is the ChurchRosser property. For concurrent declarative programs in rewriting logic, the key property checked is the coherence between rules and equations modulo the axioms A. Such properties are essential, both for executability purposes and as a basis for verifying many other properties, such as, for example, proving inductive theorems of a functional program, or correct model checking of temporal logic properties for a concurrent program. This paper develops the mathematical foundations on which the checking of these properties (or ground versions of them) is based, presents two Maude tools, the ChurchRosser Checker (CRC) and the Coherence Checker (ChC) supporting the verification of these properties, and illustrates with examples a methodology to establish such properties using the proof obligations returned by the tools.
A Userfriendly Webbased Interface for Automatically Theorem Provers and for Automated Generated Proofs
, 2010
"... Abstract. This report describes the design, the implementation and the usage of a system for managing different systems for automated theorem proving and automatically generated proofs. In particular, we focus on a userfriendly webbased interface and a structure for collecting and cataloguing proo ..."
Abstract
 Add to MetaCart
Abstract. This report describes the design, the implementation and the usage of a system for managing different systems for automated theorem proving and automatically generated proofs. In particular, we focus on a userfriendly webbased interface and a structure for collecting and cataloguing proofs in a uniform way. The second point hopefully helps to understand the structure of automatically generated proofs and builds a starting point for new insights for strategies for proof planning. 1
Constructors, Sufficient completeness . . . Generalized Rewrite Theories
, 2010
"... Sufficient completeness has been throughly studied for equational specifications, where function symbols are classified into constructors and defined symbols. But what should sufficient completeness mean for a rewrite theory R = (Σ, E, R) with equations E and nonequational rules R describing concur ..."
Abstract
 Add to MetaCart
Sufficient completeness has been throughly studied for equational specifications, where function symbols are classified into constructors and defined symbols. But what should sufficient completeness mean for a rewrite theory R = (Σ, E, R) with equations E and nonequational rules R describing concurrent transitions in a system? This work argues that a rewrite theory naturally has two notions of constructor: the usual one for its equations E, and a different one for its rules R. The sufficient completeness of constructors for the rules R turns out to be intimately related with deadlock freedom, i.e., R has no deadlocks outside the constructors for R. The relation between these two notions is studied in the setting of unconditional ordersorted rewrite theories with (i) a frozenness map restricting rewriting with R, and (ii) a contextsensitive map restricting rewriting with the equations E, as it is possible for specifications in the Maude language. Sufficient conditions are given allowing the automatic checking of sufficient completeness, and other related properties, by equational tree automata modulo equational axioms such as associativity, commutativity, and identity. They are used