Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushd...
Uloženo v:
| Vydáno v: | Logical methods in computer science Ročník 20, Issue 2 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Logical Methods in Computer Science e.V
14.05.2024
|
| Témata: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We investigate the impact of non-regular path expressions on the decidability
of satisfiability checking and querying in description logics extending ALC.
Our primary objects of interest are ALCreg and ALCvpl, the extensions of with
path expressions employing, respectively, regular and visibly-pushdown
languages. The first one, ALCreg, is a notational variant of the well-known
Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was
introduced and investigated by Loding and Serre in 2007. The logic ALCvpl
generalises many known decidable non-regular extensions of ALCreg.
We provide a series of undecidability results. First, we show that
decidability of the concept satisfiability problem for ALCvpl is lost upon
adding the seemingly innocent Self operator. Second, we establish
undecidability for the concept satisfiability problem for ALCvpl extended with
nominals. Interestingly, our undecidability proof relies only on one single
non-regular (visibly-pushdown) language, namely on r#s# := { r^n s^n | n in N }
for fixed role names r and s. Finally, in contrast to the classical database
setting, we establish undecidability of query entailment for queries involving
non-regular atoms from r#s#, already in the case of ALC-TBoxes. |
|---|---|
| AbstractList | We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages. The first one, ALCreg, is a notational variant of the well-known Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was introduced and investigated by Loding and Serre in 2007. The logic ALCvpl generalises many known decidable non-regular extensions of ALCreg. We provide a series of undecidability results. First, we show that decidability of the concept satisfiability problem for ALCvpl is lost upon adding the seemingly innocent Self operator. Second, we establish undecidability for the concept satisfiability problem for ALCvpl extended with nominals. Interestingly, our undecidability proof relies only on one single non-regular (visibly-pushdown) language, namely on r#s# := { r^n s^n | n in N } for fixed role names r and s. Finally, in contrast to the classical database setting, we establish undecidability of query entailment for queries involving non-regular atoms from r#s#, already in the case of ALC-TBoxes. We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages. The first one, ALCreg, is a notational variant of the well-known Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was introduced and investigated by Loding and Serre in 2007. The logic ALCvpl generalises many known decidable non-regular extensions of ALCreg. We provide a series of undecidability results. First, we show that decidability of the concept satisfiability problem for ALCvpl is lost upon adding the seemingly innocent Self operator. Second, we establish undecidability for the concept satisfiability problem for ALCvpl extended with nominals. Interestingly, our undecidability proof relies only on one single non-regular (visibly-pushdown) language, namely on r#s# := { r^n s^n | n in N } for fixed role names r and s. Finally, in contrast to the classical database setting, we establish undecidability of query entailment for queries involving non-regular atoms from r#s#, already in the case of ALC-TBoxes. |
| Author | Bednarczyk, Bartosz |
| Author_xml | – sequence: 1 givenname: Bartosz surname: Bednarczyk fullname: Bednarczyk, Bartosz |
| BookMark | eNpNkE1LxDAQhoOs4OcP8NajHqrJNNs23kR3VVhURM9x8lWzdJuSdFH_vdtVxDnMvPMyPAPvAZl0obOEnDB6zksQ9UW70ikHegqX1RlQ4Dtkn9Ulzaei4pN_eo8cp7SkmyoKVkO5T95mn30bou-a7CF0-bNt1i3GbPY52C750KUsuOwphj4kP2x2bLObrw5XXmeL0Gz6hx_esxubdPT9eJBv7ZTNLQ7raNMR2XXYJnv8Ow_J63z2cn2XLx5v76-vFrkGYDyvBDhlhOUUGAhU6KyiWDpUTDHACkzFtTOgBJRGKTAcGJoSFC-NcUYUh-T-h2sCLmUf_Qrjlwzo5dYIsZEYB69bK6e60FArUY6fDdZqWtSudlYgF2iKkcV-WDqGlKJ1fzxG5TZxOSYugUqQlRwTL74BKHV5Ew |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/lmcs-20(2:7)2024 |
| DatabaseName | CrossRef Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_5c3c28b962214da8b538f8fe9a49ad39 10_46298_lmcs_20_2_7_2024 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c2214-792fbd9e402129abafeb0a6fab1b12a72d74cfd2b926dbb2d421ad62b46ddfd93 |
| IEDL.DBID | DOA |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:53:36 EDT 2025 Sat Nov 29 06:21:52 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2214-792fbd9e402129abafeb0a6fab1b12a72d74cfd2b926dbb2d421ad62b46ddfd93 |
| ORCID | 0000-0002-8267-7554 |
| OpenAccessLink | https://doaj.org/article/5c3c28b962214da8b538f8fe9a49ad39 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_5c3c28b962214da8b538f8fe9a49ad39 crossref_primary_10_46298_lmcs_20_2_7_2024 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-05-14 |
| PublicationDateYYYYMMDD | 2024-05-14 |
| PublicationDate_xml | – month: 05 year: 2024 text: 2024-05-14 day: 14 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2024 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.30405 |
| Snippet | We investigate the impact of non-regular path expressions on the decidability
of satisfiability checking and querying in description logics extending ALC.
Our... We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - artificial intelligence computer science - logic in computer science |
| Title | Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features |
| URI | https://doaj.org/article/5c3c28b962214da8b538f8fe9a49ad39 |
| Volume | 20, Issue 2 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center) customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA4iHrz4FuuLHDyosHQ3yebhzUeLF0sRhd7iJNmAoK30IZ787SbZbaknL15yCGEI30ySmWQyH0Jn1JWcQR5vbXxoyhIyUxKZ0ZJbEK6izLNENiF6PTkYqP4S1VfMCavLA9fAtUtLLZFGcUIK5kCasEK99JUCpsDR9HUvF2opmEp7MKXRca6fMRknSrbf3u0k2MQ5uRIXIeJnvw6ipXr96WDpbqGNxiPE1_VMttFKNdxBm3O2Bdwsvl30skiXw73RMHtMJPJj3PlKOejBePDI434kPajTsILMu5puHkdCZYvjlSsOceZ8n8hS9wRHL3AWou499NztPN3eZw0_QmYjGJlQxBunKhbLtCsw4CuTA_dgClMQEMQJZr0jRhHujCGOkQIcJ4Zx57xTdB-tDkfD6gDhoBphmDTSsyAOKinBFdRKCjaXlkILXc7B0h91GQwdwoeErI7IapJrooWOyLbQTYRzMTBWsE4dQa-60av-S6-H_yHkCK3HCcXX_oIdo9XpeFadoDX7OX2djE-TyYT24bvzA0oSyeQ |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Exploring+Non-Regular+Extensions+of+Propositional+Dynamic+Logic+with+Description-Logics+Features&rft.jtitle=Logical+methods+in+computer+science&rft.au=Bednarczyk%2C+Bartosz&rft.date=2024-05-14&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=20%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-20%282%3A7%292024&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_20_2_7_2024 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |