A benchmark method for the propositional modal logics K, KT, S4 (Q1977575): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TPTP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1006249507577 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1593443951 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A benchmark method for the propositional modal logics K, KT, S4 |
scientific article |
Statements
A benchmark method for the propositional modal logics K, KT, S4 (English)
0 references
17 January 2001
0 references
The authors propose a set of benchmark formulas for testing automated theorem provers for the logics K, KT and S4. (The classical reference in Classical First Order Logic is the TPTP library [\textit{G. Sutcliffe} and \textit{S. Suttner}, J. Autom. Reasoning 21, No. 2, 177-203 (1998; Zbl 0910.68197)]). In addition, a method is given for assigning a performance index to different provers, according to certain postulates, so that one can compare the general efficiency of a given prover.
0 references
modal logic
0 references
benchmark formulas
0 references
automated theorem proving
0 references
