U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4):479--522, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....procedures. Most empirical testing of decision procedures for propositional modal logics, usually for the multi modal logic K (m) employs randomly generated formulae. This style of testing was initially proposed by Giunchiglia et al. [3] and later improved by them and also by Hustadt and Schmidt [6, 1]. Other kinds of randomly generated formulae have been proposed by Massacci [7] Randomly generated formulae have been used with all the recent, highly optimised modal decision procedures, including DLP [8] FaCT [4] KSatC [1] SAT [2] and TA [6] and have been used in several comparisons of ....

.... by them and also by Hustadt and Schmidt [6, 1] Other kinds of randomly generated formulae have been proposed by Massacci [7] Randomly generated formulae have been used with all the recent, highly optimised modal decision procedures, including DLP [8] FaCT [4] KSatC [1] SAT [2] and TA [6], and have been used in several comparisons of these systems [7] The basic idea behind the random generator in [3, 6, 1] is to generate a number of clauses. Each clause has the same number of disjuncts. As most testing as been on clauses with three disjuncts, the generated formulae are often ....

[Article contains additional citation context not shown here]

Ullrich Hustadt and Renate A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4):479--522, 1999.

....formulas that are too big to be parsed and or handled. Most empirical testing of decision procedures for propositional modal logics employs randomly generated formulae. This style of testing was initially proposed by Giunchiglia et al. [4] and later improved by them and also by Hustadt and Schmidt [9, 2]. Other kinds of randomly generated formulae have been proposed by Massacci [10] Randomly generated formulae have been used with all the recent, highly optimised modal decision procedures, including DLP [11] FaCT [6] KSATC [2] SAT [3] and TA [9] and have been used in several comparisons of ....

.... by them and also by Hustadt and Schmidt [9, 2] Other kinds of randomly generated formulae have been proposed by Massacci [10] Randomly generated formulae have been used with all the recent, highly optimised modal decision procedures, including DLP [11] FaCT [6] KSATC [2] SAT [3] and TA [9], and have been used in several comparisons of these systems [10] The basic idea behind the random generator in [4, 9, 2] is to generate a number of clauses. Each clause has the same number of disjuncts. As most testing as been on clauses with three disjuncts, the generated formulae are often ....

[Article contains additional citation context not shown here]

Ullrich Hustadt and Renate A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4), 1999.

.... the random 3CNF#m test methodology, was proposed by Giunchiglia and Sebastiani [ 16; 18 ] It was conceived as a generalisation of the 3SAT test method which is widely used in propositional satisfiability [ 29 ] Themethodwas subsequently criticised and improved by Hustadt and Schmidt [ 26; 27 ] who pointed out some major weaknesses, and proposed some solutions. Finally Giunchiglia et.al. 12; 13 ] proposed the current version of the method, which embeds Hustadt and Schmidt s suggestions, plus some further improvements. If not otherwise stated, from now on by random 3CNF#m ....

....more constraint violations are detected, and the higher the search tree is pruned. As a side e#ect, if a plot does not decrease after the 50 cross over point, then this may reveal a problem of constraint violation detection in the system. 5. 3 Problems As highlighted by Hustadt and Schmidt [ 26; 27 ] the formulae generated by the first version of the method su#ered from a couple of major drawbacks: Propositional) redundancy: As the initial 3CNF#m generator did not check for 306 An Analysis of Empirical Testing for Modal Decision Procedures repeated propositional variables inside the same ....

[Article contains additional citation context not shown here]

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4), 1999.

.... in [GS96c] It worths mentioning that, since [GS96a] the idea of building decision procedures for modal and description logics on top of sophisticated propositional procedures has been adopted and extended also by others (see, e.g. Hor98a, Hor98b, PS98] Later on, Hustadt and Schmidt [HS98, HS97a] pointed out some problems with the tests presented in [GS96a, GS96c] In these papers, the authors (i) present their own translation based procedure TA and implement it; ii) show that some of the tests used by Giunchiglia and Sebastiani privileged KsatLisp more than the other systems; ....

....the computational superiority of TA w.r.t. other systems, including KsatLisp. In this paper, following on Hustadt and Schmidt s suggestions about Giunchiglia and Sebastiani s tests, we further test various systems, including KsatLisp and TA. Our results contradict the conclusions in [HS97a, HS98] at the same time con rming the results in [GS96a, GS96c] More precisely, on these tests, KsatLisp has better computational properties than TA. The paper is structured as follows. In Section 2 we introduce some basic notions and notation that is used throughout the whole paper. In Section 3 we ....

[Article contains additional citation context not shown here]

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. To appear in Journal of Applied Non-Classical Logics, July 1998.

.... reported in [GS96c] It worths mentioning that, since [GS96a] the idea of building decision procedures for modal and description logics on top of sophisticated propositional procedures has been adopted and extended also by others (see, e.g. Hor98a, Hor98b, PS98] Later on, Hustadt and Schmidt [HS98, HS97a] pointed out some problems with the tests presented in [GS96a, GS96c] In these papers, the authors (i) present their own translation based procedure TA and implement it; ii) show that some of the tests used by Giunchiglia and Sebastiani privileged KsatLisp more than the other systems; ....

....the computational superiority of TA w.r.t. other systems, including KsatLisp. In this paper, following on Hustadt and Schmidt s suggestions about Giunchiglia and Sebastiani s tests, we further test various systems, including KsatLisp and TA. Our results contradict the conclusions in [HS97a, HS98] at the same time confirming the results in [GS96a, GS96c] More precisely, KsatLisp seems to have better computational properties than TA at least for the tests they consider. The paper is structured as follows. In Section 2 we introduce some basic notions and notation that is used throughout ....

[Article contains additional citation context not shown here]

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. To appear in Journal of Applied Non-Classical Logics, July 1998.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4):479--522, 1999.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. NonClassical Logics, 9(4):479--522, 1999.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4):479--522, 1999.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4), 1999.

....or by ftp from ftp.cs.man.ac.uk in the directory pub preprints. 0 1 Introduction Over the last nearly ten years a variety of methods for reasoning with modal and description logics have been developed, implemented and applied in several case studies, cf. for example [31, 36, 41, 42, 37]. Though the logics involved are very similar, the reasoning methods used and proof search strategies employed can di#er considerably. Various empiricical studies have been undertaken mainly for basic multi modal logic or its corresponding description logic ALC. Many of these studies are ....

....resolution and hyperresolution. These provers are sophisticated programs which have been developed over many years. Of these provers, spass forms the basis of the theorem prover mspass which has been used to study the practical properties of R and R for automating modal logic reasoning [42, 46, 47, 48, 69]. These studies have been mainly for basic multi modal logic. Furthermore, with one exception, a variation of the optimised functional translation method was used, since mspass has shown a better performance for the optimised functional translation method compared to the relational translation ....

[Article contains additional citation context not shown here]

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4):479--522, 1999.

....satisfiability. Thus, many of the properties of K and KD carry over to the functional modal fragment, among others also the permutability of universal and existential quantification [23] which reduces the functional modal fragment into the Bernays Schonfinkel class (the # prefix class) [14, 4]. Permutability of universal and existential quantification is not generally applicable. For instance, it does not extend to full fluted logic; actually it does not even extend to the relational modal fragment associated with modal logic K . In [27] a formula in K is identified where the use of ....

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4):479--522, 1999.

....description logics like ALB (without converse) 16] which cannot be embedded in the guarded fragment, can be embedded in uted logic. Interestingly, translations of propositional modal formulae by both the relational translation and a variation of the functional translation (described and used in [11, 14]) are uted formulae. This raises the question whether the results of Ohlbach and Schmidt [19, 26] can be generalised to uted logic. The answer to this question is negative, though. Already the use of the quanti er exchange operator, which swaps existential and universal quanti ers in a ....

....of the class of (strongly) uted clauses are the most dicult parts of the termination proof. The diculty can be attributed to the fact that the depth of terms can grow during the derivation, as is the case for some other solvable clausal classes, for example, those associated with Maslov s class K [5, 14]. The paper is organised as follows. Fluted logic is de ned in Section 2. Section 3 gives a brief description of the general ordered resolution calculus. The class of uted clauses is de ned in Section 4. In Section 5 we specify how uted formulae can be translated into sets of uted clauses. The ....

[Article contains additional citation context not shown here]

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4), 1999.

....in better performance for di erent problem sets. Experimental evidence for this is that for some problem sets good performance can be achieved with SPASS using ordered resolution while not so good performance with tableaux proof systems, and for some problem sets the situation is reversed, cf. [22, 24, 27]. However, by competitive testing alone it is near impossible to identify the major factors having a positive or negative in uence on the performance of a theorem prover [20] As long as the theorem provers which are being compared follow di erent search strategies this di erence is likely to have ....

....ability and Building Models 27 extension of the strict subterm ordering on ground arguments. It is realised in SPASS by specifying a suitable precedence on the vocabulary for the built in extended Knuth Bendix ordering. The experiments were performed on randomly generated formulae analysed in [23, 24]. The generated formulae are in modal conjunctive normal form determined by ve parameters: N , the number of propositional variables, M , the number of modalities, K, the number of disjuncts, L, the number of conjuncts, D, the modal degree, and P , the probability of being a propositional ....

[Article contains additional citation context not shown here]

Hustadt, U. and R. A. Schmidt: 1999a, `An Empirical Analysis of Modal Theorem Provers'. Journal of Applied Non-Classical Logics 9(4).

....description logics like ALB (without converse) 8] which cannot be embedded in the guarded fragment, can be embedded in uted logic. Interestingly, translations of propositional modal formulae by both the relational translation and a variation of the functional translation (described and used in [4, 6]) are uted formulae. In [15] we characterise uted logic by a new class of clauses, called the class of uted clauses. We present a decision procedure for this class which is based on an ordering re nement of resolution and an additional separation rule. This is a new inference rule which does ....

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4), 1999.

....logics, and formulae of the relational calculus. spass [19, 20] is one of the fastest and most sophisticated theorem provers for rst order logic with equality, and it s performance compares well with special purpose theorem provers for modal logics, description logics and rst order logic [7, 11, 18]. The input language of spass was extended to accept as input also modal, relational and description logic formulae. Modal formulae and description logic formulae are built from a vocabulary of propositional symbols of two disjoint types, namely, propositional (Boolean or concept) and relational ....

.... In the current implementation of mspass the available translation methods include: the standard relational translation method, the functional translation method [1, 5, 14] the optimised functional translation method [15] including a variation de ned in terms of n ary predicates [7], as well as the semi functional translation method [12] The implementation of the relational translation method is most general and applies to the language described in Section 1. Some restrictions apply to the other methods. The functional translation, optimised functional and ....

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9(4):479-522, 1999.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. To appear in J. Appl. Non-Classical Logics, 1998.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. To appear in J. Appl. Non-Classical Logics, 1998.

No context found.

Hustadt, U., and R. A. Schmidt. 1999a. An empirical analysis of modal theorem provers. To appear in Journal of Applied Non-Classical Logics.

No context found.

U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics, 9(4), 1999.

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