A PSpace algorithm for graded modal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1632, Issue , 1999, Pages 52-66

  Tobies, Stephan ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER CIRCUITS; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; RECONFIGURABLE HARDWARE; THEOREM PROVING;

ALGORITHMIC APPROACH; GRADED MODAL LOGIC; LOWER BOUNDS; MODAL LOGIC; NATURAL EXTENSION; SATISFIABILITY;

ALGORITHMS;

EID: 84957697460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_4     Document Type: Conference Paper

References (17)

1. H. Andréka, J. van Benthem, and I. Németi Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217-274, 1998.
2. F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1-2):195-213, 1996.
3. D. Calvanese, M. Lenzerini, and D. Nardi. A Unified Framework for Class Based Representation Formalisms. Proc. of KR-94, 1994.
4. W. Van der Hoek and M. De Rijke. Counting objects. Journal of Logic and Computation, 5(3):325-345, June 1995.
5. F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and, Computation, 134(1):1-58, 10 April 1997.
6. K. Fine. In so many possible worlds. Notre Dame Journal of Formal Logic, 13:516-520, 1972.
7. F. Giunchiglia and R. Sebastiani. uilding decision procedures for modal logics from propositional decision procedures—the case study of modal K. Proc. of CADE-13, LNCS 1104. Springer, 1996.
8. B. Hollunder and F. Baader. Qualifying number restrictions in concept languages. In Proc. of KR-91, pages 335-346, Boston (USA), 1991.
9. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for model logics of knowledge and belief. Artificial Intelligence, 54(3):319-379, April 1992.
10. U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logic. In Proc. of IJCAI-97, volume 1, pages 202-207, 1997.
11. R. E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3):467-480, September 1977.
12. H. J. Ohlbach and R. A. Schmidt. Functional translation and second- order frame properties of modal logics. Journal of Logic and, Computation, 7(5):581-603, October 1997.
13. H. J. Ohlbach, R. A. Schmidt, and U. Hustadt. Translating graded modalities into predicate logic. In H. Wansing, editor, Proof Theory of Modal Logic, volume 2 of Applied Logic Series, pages 253-291. Kluwer, 1996.
14. W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177-192, April 1970.
15. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91, pages 466-471, 1991.
16. R. A. Schmidt. Resolution is a decision procedure for many propositional modal logics: Extended abstract. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic’96. CLSI Publications, 1997.
17. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1-26, 1991.