C.B.Suttner and G.Sutcliffe. ATP system results for the TPTP problem library. Technical Report AR-96-02,96/09, Institut fur Informatik, Munchen and Dept. of Computer Science, James Cook University, Australia, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Anytime Reasoning in First-Order Logic - Keith Vanderveen And (Correct)
....reserves a portion of the time given to solve a problem for direct consideration of the input sentence. 5 Results We tested the anytime first order reasoning algorithm on a set of 108 first order logic problems from the Thousands of Problems for Theorem Provers (TPTP) problem library, v1.2. 1 [2]. The 108 problems were chosen to provide balance in the number of satisfiable and unsatisfiable problems, with 54 of each. There are 59 known satisfiable problems in v1.2.1 of the TPTP, and our parser for the problem representation language broke down for 5 of them, so we included the 54 others ....
C.B.Suttner and G.Sutcliffe. ATP system results for the TPTP problem library. Technical Report AR-96-02,96/09, Institut fur Informatik, Munchen and Dept. of Computer Science, James Cook University, Australia, 1996.
Partial Instantiation Theorem Proving for Distributed.. - Vanderveen, Ramamoorthy (Correct)
....to CORBA s mechanism for describing services is that requesters need to know the type of a service in order to use it. CORBA s system doesn t allow a new service to be described in terms of more basic or familiar services. That is to say, CORBA s trading service lacks declarative semantics [18]. Another drawback to CORBA s trading service is that the trader is unable to compose two or more services to satisfy a request. That is, if one service translated latex files to dvi files, and another service translated dvi files to postscript files, then a requester which asked a CORBA trader ....
.... actually made up of two languages: Knowledge Query and Manipulation Language (KQML) and Knowledge Interchange Format (KIF) KQML serves as a wrapper or envelope for a KIF message, conveying the purpose of the message, the receiver, the sender, the time it was sent, and other contextual information [18]. KIF carries the actual logical content of the message, and it has the full expressive power of first order predicate logic [4] Another content language which has been used with KQML is CycL, the knowledge representation and exchange language used by the Cyc project [10] CycL is similar to KIF ....
[Article contains additional citation context not shown here]
C. Suttner and G. Sutcliffe. Atp system results for the tptp problem library. Technical Report AR-96-02,96/09, Institut fur Informatik,Munchen and Dept. of Computer Science, James Cook University, Australia, 1996.
The CADE-14 ATP System Competition - Suttner, Sutcliffe (1998) (12 citations) Self-citation (Sutcliffe Suttner) (Correct)
No context found.
SS97a. G. Sutcliffe and C.B. Suttner. ATP System Results for the TPTP Problem Library. http://www.cs.jcu.edu.au/~tptp/TPTP/Results.html, 1997.
The CADE-14 ATP System Competition - Suttner, Sutcliffe (1998) (12 citations) Self-citation (Sutcliffe Suttner) (Correct)
No context found.
SS97a. G. Sutcliffe and C.B. Suttner. ATP System Results for the TPTP Problem Library. http://www.cs.jcu.edu.au/~tptp/TPTP/Results.html, 1997.
The CADE-14 ATP System Competition - Sutcliffe, Suttner (1998) (12 citations) Self-citation (Sutcliffe Suttner) (Correct)
....Common LISP, v4.1. The entrant used the machine directly at his home site. 3.2 Problems 3.2.1 Problem Selection The problems were selected from the TPTP Problem Library, v2.0.0. The problems had to meet certain criteria to be eligible for selection: ffl The TPTP uses system performance data [SS97a] to classify problems as one of: Easy: Solvable by all state of the art ATP systems Difficult: Solvable by some state of the art ATP systems Unsolved: Solvable by no state of the art ATP systems Open: Theorem hood unknown Difficult problems were eligible for all the competition ....
....Division the entrant could choose to use either a CPU or a wall clock time limit. Only one system, OCTOPUS, used a wall clock time limit. The method used to decide on the time limit was similar to that used for CASC 13. A minimal time limit of 180 seconds was used, based on system performance data [SS97a] and experience gained in CASC 13. This minimal time limit was advertised in the CASC 14 Call for Participation, and no entrant expressed dissatisfaction. The maximal time limit was determined using the relationship given in Section 3.2.2, with 21 (the minimal number of problems) as the number of ....
G. Sutcliffe and C.B. Suttner. ATP System Results for the TPTP Problem Library. http://www.cs.jcu.edu.au/~tptp/TPTP/Results.html, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC