Papers by Christian Suttner
Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Prov... more Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First, for the researchers, it is difficult to determine if a direction of investigation is making a meaningful contribution. Second, for unaware observers, a lack of progress leads to a loss of interest and confidence in the field. In this context it is important that progress in ATP be measured, monitored, and recognized. This paper presents quantitative measures that show progress in ATP, from mid-1997 to mid-2001. The measures are based on collected performance data from ATP systems.
Researchers who make theoretical advances also need some way to demonstrate that an advance reall... more Researchers who make theoretical advances also need some way to demonstrate that an advance really does have general, overall positive consequences for system performance. For this it is necessary to evaluate the system on a set of problems that is sufficiently large and diverse to be somehow representative of the intended application area as a whole. It is only a small step from system evaluation to a communal system competition. The CADE ATP System Competition (CASC) has been run annually since 1996. Any competition is difficult to design and organize in the first instance, and to then run over the years. In order to obtain the full benefits of a competition, a thoroughly organized event, with an unambiguous and motivated design, is necessary. For some issues relevant to the CASC design, inevitable constraints have emerged. For other issues there have been several choices, and decisions have had to be made. This paper describes the evolution of CASC, paying particular attention to...
Journal of Automated Reasoning, Oct 1, 1998
This paper provides a detailed description of the CNF part of the TPTP Problem Library for automa... more This paper provides a detailed description of the CNF part of the TPTP Problem Library for automated theorem-proving systems. The library is available via the Internet and forms a common basis for development and experimentation with automated theorem provers. This paper explains the motivations and reasoning behind the development of the TPTP (thus implicitly explaining the design decisions made) and describes the TPTP contents and organization. It also provides guidelines for obtaining and using the library, summary statistics about release v1.2.1, and an overview of the tptp2X utility program. References for all the sources of TPTP problems are provided.
HEUROPA: Heuristic Optimization of Parallel Computations
ABSTRACT . The performance of almost all parallel algorithms and systems can be improved by the u... more ABSTRACT . The performance of almost all parallel algorithms and systems can be improved by the use of heuristics that affect the parallel execution. However, since optimal guidance usually depends on many different influences, establishing such heuristics is often difficult. Due to the importance of heuristics for optimizing parallel execution, and the similarity of the problems that arise for establishing such heuristics, the HEUROPA activity was founded to attack these problems in a uniform way. To overcome the difficulties of specifying heuristics by hand, machine learning techniques have been employed to obtain heuristics automatically. This paper presents the general approach used for learning heuristics, describes the applications arising in the various subprojects, and provides a detailed case study using the approach for a particular application. 1 Introduction Parallel algorithms represent complex software, with a large number of parameters that need to be adjusted for optimal perfor...
Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Prov... more Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First, for the researchers, it is difficult to determine if a direction of investigation is making a meaningful contribution. Second, for unaware observers, a lack of progress leads to a loss of interest and confidence in the field. In this context it is important that progress in ATP be measured, monitored, and recognized. This paper presents quantitative measures that show progress in ATP, from mid-1997 to mid-2001. The measures are based on collected performance data from ATP systems.
This paper provides a detailed description of the CNF part of the TPTP Problem Library for automa... more This paper provides a detailed description of the CNF part of the TPTP Problem Library for automated theorem-proving systems. The library is available via the Internet and forms a common basis for development and experimentation with automated theorem provers. This paper explains the motivations and reasoning behind the development of the TPTP (thus implicitly explaining the design decisions made) and describes the TPTP contents and organization. It also provides guidelines for obtaining and using the library, summary statistics about release v1.2.1, and an overview of the tptp2X utility program. References for all the sources of TPTP problems are provided.
Jar, 1997
The CADE-13 ATP System Competition was the rst large scale controlled competition for 1st order A... more The CADE-13 ATP System Competition was the rst large scale controlled competition for 1st order ATP systems. Many people have commented on various aspects of the competition, including some suggestions for future improvement. These comments, and some discussion of them, are contained in this paper. An overview of the major issues that will a ect future competitions is given.
Special Issue: The CADE-13 ATP System Competition
Jar, 1997
Mathematics in the TPTP Problem Library (v1.2.1)
ABSTRACT
Special Issue: The CADE13 ATP System Competition
Journal of Automated Reasoning, 1997
Lecture Notes in Computer Science, 2008
The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classica... more The CADE ATP System Computer (CASC) evaluates the performance of sound, fully automatic, classical first-order 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 4th IJCAR ATP System Competition (CASC-J4) was held on 13th August 2008. The design of the competition and it's rules, and information regarding the competing systems, are provided in this report.
Parallel Theorem Provers Based on Setheo
Applied Logic Series, 1998
Lecture Notes in Computer Science, 2003
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Au... more The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC series. Twenty-four ATP system variants competed in the various competition and demonstration divisions. An outline of the design, and a commentated summary of the results, are presented.
Journal of Automated Reasoning, 1997
Abstract. This article describes the practical procedures that were used to run the CADE-13 ATP S... more Abstract. This article describes the practical procedures that were used to run the CADE-13 ATP System Competition. The article describes the hardware and software environments, the system installation, the soundness testing performed, the preparation of problems for the ...
Journal of Automated Reasoning, 1999
The results of the CADE-15 ATP System Competition (CASC-15) are presented.
The Procedures of the CADE-13
Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Prov... more Despite some impressive individual achievements, the extreme difficulty of Automated Theorem Proving (ATP) means that progress in ATP is slow relative to, e.g., some aspects of commercial information technology. The (relatively) slow progress has two distinct disadvantages. First, for the researchers, it is difficult to determine if a direction of investigation is making a meaningful contribution. Second, for unaware observers, a lack of progress leads to a loss of interest and confidence in the field. A serious outcome of this loss of interest and confidence has been the withdrawal of significant funding for ATP research. In this context of slow progress, it is important that progress in ATP be measured, monitored, and recognized. This paper presents quantitative measures that show progress in ATP, from mid-1997 to the end of 1999. The measures are based on collected performance data from ATP systems.
Parallel Automated Theorem Prov-ing
Proceedings of ECAI-96 Workshop: Empirical AI
Parallelization of search-based systems by static partitioning with slackness /
ABSTRACT
Uploads
Papers by Christian Suttner