PSpace reasoning for graded modal logics

Journal of Logic and Computation

Volumn 11, Issue 1, 2001, Pages 85-106

  Tobies, S ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Complexity; Counting; Description logic; Graded modalities; Modal logic

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; KNOWLEDGE ENGINEERING; MODAL ANALYSIS; PROBLEM SOLVING; SET THEORY;

GRADED MODAL LOGICS;

FORMAL LOGIC;

EID: 0035247702     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.1.85     Document Type: Article

References (19)

1. Modal languages and bounded fragments of predicate logic
2. Cardinality restrictions on concepts
3. A unified framework for class based representation formalisms
4. Counting objects
5. The complexity of concept languages
6. In so many possible worlds
7. Building decision procedures for modal logics from propositional decision procedures - The case study of modal K
8. Qualifying number restrictions in concept languages
9. A guide to completeness and complexity for model logics of knowledge and belief
10. On evaluating decision procedures for modal logic
11. Practical reasoning for expressive description logics
12. The computational complexity of provability in systems of modal propositional logic
13. Functional translation and second-order frame properties of modal logics
14. Translating graded modalities into predicate logic
15. Relationships between nondeterministic and deterministic tape complexities
16. A correspondence theory for terminological logics: Preliminary report
17. Resolution is a decision procedure for many propositional modal logics: Extended abstract
18. Attributive concept descriptions with complements
19. A PSpace algorithm for graded modal logic