Exploring non-regular extensions of propositional dynamic logic with description-logics features

DOI10.46298/lmcs-20(2:7)2024MaRDI QIDQ6563054

Bartosz Bednarczyk

Publication date: 27 June 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitydescription logicsnominalspropositional dynamic logicvisibly pushdown languages(un)decidability\(\mathcal{ALC}_{\mathrm{reg}}\)non-regular extensions

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
• Propositional dynamic logic of regular programs
• More on nonregular PDL: Finite models and Fibonacci-like programs
• A goal-directed decision procedure for hybrid PDL
• Propositional dynamic logic with recursive programs
• Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
• Conjunctive Visibly-Pushdown Path Queries
• An Introduction to Description Logic
• Deciding Properties of Nonregular Programs
• Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
• Adding nesting structure to words
• Reasoning and Query Answering in Description Logics
• Fragments of First-Order Logic

This page was built for publication: Exploring non-regular extensions of propositional dynamic logic with description-logics features