Results 1 
8 of
8
Otter: The CADE13 Competition Incarnations
 JOURNAL OF AUTOMATED REASONING
, 1997
"... This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter. ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter.
AgentOriented Integration of Distributed Mathematical Services
 Journal of Universal Computer Science
, 1999
"... Realworld applications of automated theorem proving require modern software environments that enable modularisation, networked interoperability, robustness, and scalability. These requirements are met by the AgentOriented Programming paradigm of Distributed Artificial Intelligence. We argue that ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
Realworld applications of automated theorem proving require modern software environments that enable modularisation, networked interoperability, robustness, and scalability. These requirements are met by the AgentOriented Programming paradigm of Distributed Artificial Intelligence. We argue that a reasonable framework for automated theorem proving in the large regards typical mathematical services as autonomous agents that provide internal functionality to the outside and that, in turn, are able to access a variety of existing external services. This article describes...
On the Evaluation of Image Segmentation Algorithms
 in DICTA’97 and IVCNZ’97
, 1997
"... In this paper, I will address the problems of segmentation evaluation in the context of what types of evaluation can and should be performed. Also, I propose a graphical method for presenting results of empirical evaluation experiments which utilises an independent ordering of data curves for com ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, I will address the problems of segmentation evaluation in the context of what types of evaluation can and should be performed. Also, I propose a graphical method for presenting results of empirical evaluation experiments which utilises an independent ordering of data curves for comparison of segmentation algorithms. Keywords: feature detection, segmentation evaluation, 2D segmentation 1 Introduction Image segmentation is a fundamental process in many computer vision applications. In fact, image interpretation applications are just complex image segmentation algorithms! In a more conventional sense, however, image segmentation is the partitioning of an image into its constituent regions, where parts within a region are similar according to some uniformity predicate, and dissimilar between neighbouring regions. Due to its importance, many segmentation algorithms have been proposed, and a number of evaluation criteria have also been proposed. In spite of this, ve...
Efficient FirstOrder Semantic Deduction Techniques
, 1998
"... Mathematical logic formalizes the process of mathematical reasoning. For centuries, it has been a dream of mathematicians to do mathematical reasoning mechanically. In the TPTP library, one finds thousands of problems from various domains of mathematics such as group theory, number theory, set theor ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mathematical logic formalizes the process of mathematical reasoning. For centuries, it has been a dream of mathematicians to do mathematical reasoning mechanically. In the TPTP library, one finds thousands of problems from various domains of mathematics such as group theory, number theory, set theory, etc. Many of these problems can now be solved with state of the art automated theorem provers. Theorem proving also has applications in artificial intelligence and formal verification. As a formal method, theorem proving has been used to verify the correctness of various hardware and software designs. In this thesis, we propose a novel firstorder theorem proving strategy  ordered semantic hyper linking (OSHL). OSHL is an instancebased theorem proving strategy. It proves firstorder unsatisfiability by generating instances of firstorder clauses and proving the set of instances to be propositionally unsatisfiable. OSHL can use semantics, i.e. domain information, to guide its search. OS...
The CADE14 ATP System Competition
 Journal of Automated Reasoning
, 1998
"... This paper documents the design, procedures, competing systems, results, and conclusions of the CADE14 ATP System Competition (CASC14). 1 Introduction The CADE14 ATP System Competition (CASC14) was held on Wednesday 16th July 1997, as part of CADE14 at the Sheraton Breakwater Hotel, Townsville ..."
Abstract
 Add to MetaCart
This paper documents the design, procedures, competing systems, results, and conclusions of the CADE14 ATP System Competition (CASC14). 1 Introduction The CADE14 ATP System Competition (CASC14) was held on Wednesday 16th July 1997, as part of CADE14 at the Sheraton Breakwater Hotel, Townsville, Australia. CASC14 was the second CADE ATP system competition, following the successful competition at CADE13 in 1996 at Rutgers University, New Brunswick, USA [SS97b]. CASC14 evaluated the performance of sound, fully automatic, 1st order ATP systems. The evaluation was in terms of the number of problems solved and the average runtime for successful solutions. The evaluation was done in the context of a bounded number of eligible problems chosen from the TPTP Problem Library [SSar, SS97f] and a specified time limit for each solution attempt. Eighteen ATP systems, listed in Table 1, were entered into the various competition and demonstration divisions. ATP System Entrants Allpaths Joe Hor...
The Procedures of the CADE13 . . .
 SS97D. C.B. SUTTNER AND G. SUTCLIFFE. THE DESIGN OF THE CADE13 ATP SYSTEM COMPETITION
, 1997
"... This paper describes the practical procedures that were used to run the CADE13 ATP System Competition. The paper describes the hardware and software environments, the system installation, the soundness testing performed, the preparation of problems for the competition, the choice of the number of pr ..."
Abstract
 Add to MetaCart
This paper describes the practical procedures that were used to run the CADE13 ATP System Competition. The paper describes the hardware and software environments, the system installation, the soundness testing performed, the preparation of problems for the competition, the choice of the number of problems and the time limit, and the execution of the systems.