scientific article; zbMATH DE number 1341607

MaRDI QIDQ4263156zbMATH OpenFDO

Authors Stephan Tobies

Publication date 22 September 1999

zbMATH Keywords

satisfiabilityknowledge representationtableauxgraded modal logicPSpace algorithm

Mathematics Subject Classification ID

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

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)

• \(\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\)
• PSPACE bounds for rank-1 modal logics
• Description Logics
• Comparative study of variable precision rough set model and graded rough set model
• PSpace reasoning for graded modal logics
• Presburger Modal Logic Is PSPACE-Complete
• EXPtime tableaux for ALC
• scientific article; zbMATH DE number 5046366 (Why is no real title available?)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
• Solving graded/probabilistic modal logic via linear inequalities (system description)

This page was built for publication:

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