{"title":"基于网格的描述逻辑中的查询回答","authors":"Krishna Manoorkar, Ruoding Wang","doi":"arxiv-2409.02289","DOIUrl":null,"url":null,"abstract":"Recently, the description logic LE-$\\mathcal{ALC}$ was introduced for\nreasoning in the semantic environment of the enriched formal contexts, and a\ntableaux algorithm was developed for checking the consistency of ABoxes in this\nlogic \\cite{van2023non}. In this paper, we study the ontology-mediated query\nanswering in LE-$\\mathcal{ALC}$. In particular, we show that several different\ntypes of queries can be answered efficiently for LE-$\\mathcal{ALC}$ knowledge\nbases with acyclic TBoxes using our tableaux algorithm directly or by extending\nit with some additional rules.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Query answering in lattice-based description logic\",\"authors\":\"Krishna Manoorkar, Ruoding Wang\",\"doi\":\"arxiv-2409.02289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, the description logic LE-$\\\\mathcal{ALC}$ was introduced for\\nreasoning in the semantic environment of the enriched formal contexts, and a\\ntableaux algorithm was developed for checking the consistency of ABoxes in this\\nlogic \\\\cite{van2023non}. In this paper, we study the ontology-mediated query\\nanswering in LE-$\\\\mathcal{ALC}$. In particular, we show that several different\\ntypes of queries can be answered efficiently for LE-$\\\\mathcal{ALC}$ knowledge\\nbases with acyclic TBoxes using our tableaux algorithm directly or by extending\\nit with some additional rules.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.02289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.02289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Query answering in lattice-based description logic
Recently, the description logic LE-$\mathcal{ALC}$ was introduced for
reasoning in the semantic environment of the enriched formal contexts, and a
tableaux algorithm was developed for checking the consistency of ABoxes in this
logic \cite{van2023non}. In this paper, we study the ontology-mediated query
answering in LE-$\mathcal{ALC}$. In particular, we show that several different
types of queries can be answered efficiently for LE-$\mathcal{ALC}$ knowledge
bases with acyclic TBoxes using our tableaux algorithm directly or by extending
it with some additional rules.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
