A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics k, kt, s4. Technical Report IAM-96-015, University of Bern, Switzerland, October 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Direct Resolution for Modal-like Logics - Carlos Areces Juan (2002) (Correct)
....internal sets of clauses) We plan to enhance the output of the prover, making possible to display a concise refutation proof in case it finds one, or a model satisfying the input otherwise. Testing. During the development of HyLoRes, we made extensive used of test sets like those described in [6, 11] to evaluate the performance of the prover and guide design decisions. And important drawback of these test sets though, is that they only provide purely modal input. We are at the moment developing a random generator of hybrid formulas following the algorithm presented in [12] to test the ....
P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning, 24(3):297--317, 2000.
Optimizing a BDD-based Modal Solver - Pan, Vardi (Correct)
....are commonly used as a compact representation of states. One of their advantages is that they enable efficient operations for certain manipulations on BDDs. The work reported in [21] consisted of a viability study for the BDD based approach, using existing benchmarks of modal formulas, TANCS 98 [13] and TANCS 2000 [18] and comparing performance with with that of the DPLL based solver SAT [33] and the tableau based solver DLP [22] A straightforward implementation of the BDD based approach did not yield a competitive algorithm, but an implementation using a careful representation of types ....
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Technical report, Universitat Bern, Switzerland, 1996.
Modelling Modal Satisfiability in Constraint Logic.. - Brand, Gennari, de Rijke (Correct)
....checking there is large and rapidly expanding body of experimental knowledge; see, e.g. 7] In contrast, empirical aspects of modal satisfiability checking have only recently drawn the attention of researchers. We now have a number of test sets, some of which have been evaluated extensively [4, 10, 8, 13, 12]. In addition, we also have a clear set of guidelines for performing empirical testing in the setting of modal logic [10, 12] Currently, there are three main test methodologies for modal satisfiability solvers, one based on hand crafted formulas, the other two based on randomly generating ....
....satisfiability checking have only recently drawn the attention of researchers. We now have a number of test sets, some of which have been evaluated extensively [4, 10, 8, 13, 12] In addition, we also have a clear set of guidelines for performing empirical testing in the setting of modal logic [10, 12]. Currently, there are three main test methodologies for modal satisfiability solvers, one based on hand crafted formulas, the other two based on randomly generating problems. To understand on what kinds of problems a particular prover does or does not do well, it helps to work with test formulas ....
[Article contains additional citation context not shown here]
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT, S4. Technical Report IAM-96-015, University of Bern, 1996.
DLP System Description - Patel-Schneider (1998) (Correct)
....performed capably on this knowledge base, creating the subsumption partial order in 210 seconds on a Sparc Ultra 1 class machine. FaCT also takes about 200 seconds for this task on a comparable machine. DLP has also been tested on two sets of benchmarks, the Tableaux 98 comparison benchmarks [ Heuerding and Schwendimann, 1996 ] and a collection of hard random modal formulae due to Hustadt and Schmidt [ Hustadt and Schmidt, 1997 ] DLP outperformed the existing description logic systems on the Tableaux 98 benchmarks and was competitive with FaCT, the fastest description logic system on the random formulae. More detail ....
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics k, kt, s4. Technical report IAM-96-015, University of Bern, Switzerland, October 1996.
HyLoRes: A Hybrid Logic Prover Based on Direct Resolution - Areces, Heguiabehere (2002) (Correct)
....modal QBF test, observing a similar behavior as in plot a) The differences between HyLoRes 0.9 and HyLoRes 1.0 peak on satisfiable problems, where the prover needs to perform a full exploration of the clause set to reach saturation. Plots c) and d) use the hand tailored test set defined in [9]. This test set consists of 9 different kinds of problems, each kind itself split into satisfiable and unsatisfiable test cases (the different test sets are listed on the horizontal axis, the postfix n identify satisfiable problems, while p identify unsatisfiable problems) Finally, each of these ....
P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning, 24(3):297--317, 2000.
BDD-Based Decision Procedures for K - Pan, Sattler, Vardi (2002) (10 citations) (Correct)
....representation of states. One of their advantages is that they come with efficient operations for certain manipulations on BDDs. This paper consists of a viability study for our approach. To see whether it yields competitive algorithms, we used existing benchmarks of modal formulas, TANCS 98 [15] and TANCS 2000 [19] and we compared our algorithms with SAT [27] and DLP [22] A straightforward implementation of our approach did not yield a competitive algorithm, but an optimized implementation did yield a competitive algorithm (see Fig. 1) indicating the viability of our approach. The ....
....in C using the CUDD 2.3.0 [25] package for BDDs. The parser for the languages used in the benchmark suites are taken with permission from SAT [27] In the following, we describe and compare the performance of the different algorithms. As benchmarks, we used both the K part of TANCS 98 [15] and portions of the MODAL PSPACE division of TANCS 2000 [19] and compared our implementation with SAT [27] and portions with DLP [22] We compared the different algorithms with respect to the number of benchmark formulas whose satisfiability they can decide within a specific time frame. In ....
[Article contains additional citation context not shown here]
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Technical report, Universitat Bern, Switzerland, 1996.
Towards a benchmark for Semantic Web reasoners - an analysis.. - Tempich, Volz (7 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics k, kt, s4. Technical Report IAM-96-015, University of Bern, Switzerland, October 1996.
Direct Resolution for Modal-like Logics - Carlos Areces Juan (2002) (Correct)
No context found.
P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning, 24(3):297-- 317, 2000.
Structured Problems for Modal Satisfiability Testing - Heguiabehere, Lopez, de Rijke (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, and S4. Technical report IAM-96-015, University of Bern, Switzerland, 1996.
Building Logic Toolboxes - Heguiabehere (2003) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, and S4. Technical report IAM96 -015, University of Bern, Switzerland, 1996.
Building Logic Toolboxes - Heguiabehere (2003) (Correct)
No context found.
P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning, 24(3):297--317, 2000.
The Random Modal QBF Test Set - Heguiabehere, de Rijke (2001) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, and S4. Technical report IAM-96-015, University of Bern, Switzerland, 1996.
Constraint Methods for Modal Satisfiability - Brand, Gennari, de Rijke (Correct)
No context found.
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT, S4. Technical Report IAM-96-015, University of Bern, 1996.
Towards a benchmark for Semantic Web reasoners - an analysis.. - Tempich, Volz (2003) (7 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics k, kt, s4. Technical Report IAM-96-015, University of Bern, Switzerland, October 1996.
An Empirical Analysis Of Modal Theorem Provers - Hustadt, Schmidt (6 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Technical Report IAM-96015, University of Bern, Switzerland, 1996.
Constraint Programming for - Modelling And Solving (Correct)
No context found.
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT , S4. Technical Report IAM-96-015, University of Bern, 1996.
Constraint Methods for Modal Satisfiability - Brand, Gennari, de Rijke (Correct)
No context found.
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT, S4. Technical Report IAM-96-015, University of Bern, 1996.
An Analysis of Empirical Testing for Modal Decision.. - Horrocks.. (2000) (22 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Technical Report IAM-96-015, University of Bern, Switzerland, 1996.
Optimizing Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (18 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, and S4. Technical report IAM-96-015, University of Bern, Switzerland, October 1996.
Optimising Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (28 citations) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, and S4. Technical report IAM-96-015, University of Bern, Switzerland, October 1996.
Finite CSP Solvers for Modal Satisfiability - Brand, Gennari, de Rijke (2003) (Correct)
No context found.
Heuerding, A. and S. Schwendimann, A Benchmark Method for the Propositional Modal Logics K, KT, S4, Technical Report IAM-96-015, University of Bern (1996).
Constraint Programming for Modelling and Solving Modal.. - Brand, Gennari, de Rijke (2003) (Correct)
No context found.
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT , S4. Technical Report IAM-96-015, University of Bern, 1996.
Constraint Programming for - Modelling And Solving (Correct)
No context found.
A. Heuerding and S. Schwendimann. A Benchmark Method for the Propositional Modal Logics K , KT , S4. Technical Report IAM-96-015, University of Bern, 1996.
HyLoRes: Direct Resolution for Hybrid Logics - Areces, Heguiabehere (Correct)
No context found.
P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Automated Reasoning, 24(3):297-317, 2000.
Logic Programming: The Case of Description and Hybrid Logic - Areces (Correct)
No context found.
A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT , S4. Technical Report IAM-96-015, University of Bern, Switzerland, 1996.
First 50 documents
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