A PSpace algorithm for graded modal logic

DOI10.1007/3-540-48660-7_4MaRDI QIDQ4263156zbMATH OpenFDO

Authors Stephan Tobies

Publication date 22 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48660-7_4

zbMATH Keywords

graded modal logicknowledge representationPSpace algorithmsatisfiabilitytableaux

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• PSpace reasoning for graded modal logics
• scientific article; zbMATH DE number 2090317
• Graded computation tree logic
• Presburger Modal Logic Is PSPACE-Complete
• Model checking for graded CTL

Cited in

(11)

• EXPtime tableaux for ALC
• \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting
• A PSpace algorithm for acyclic epistemic DL \(\mathcal{ALCS}5_m\)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
• PSpace reasoning for graded modal logics
• Solving graded/probabilistic modal logic via linear inequalities (system description)
• PSPACE bounds for rank-1 modal logics
• Presburger Modal Logic Is PSPACE-Complete
• Description Logics
• Comparative study of variable precision rough set model and graded rough set model
• scientific article; zbMATH DE number 5046366 (Why is no real title available?)

This page was built for publication: A PSpace algorithm for graded modal logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263156)