Beyond ALC_reg : exploring non-regular extensions of PDL with description logics features
From MaRDI portal
Publication:6545542
Recommendations
Cites work
- A Decidable Non-Regular Modal Fixpoint Logic
- Adding nesting structure to words
- An introduction to description logic
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- Conjunctive visibly-pushdown path queries
- Deciding Properties of Nonregular Programs
- Fragments of First-Order Logic
- scientific article; zbMATH DE number 3862425 (Why is no real title available?)
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 5599076 (Why is no real title available?)
- scientific article; zbMATH DE number 3772937 (Why is no real title available?)
- scientific article; zbMATH DE number 2090317 (Why is no real title available?)
- More on nonregular PDL: Finite models and Fibonacci-like programs
- Propositional dynamic logic of regular programs
- Propositional dynamic logic with recursive programs
- Reasoning and query answering in description logics
- Regularity Problems for Visibly Pushdown Languages
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
- Undecidability of the logic of overlap relation over discrete linear orderings
- Verification of evolving graph-structured data under expressive path constraints
This page was built for publication: Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545542)
