We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be distinguished from second-order quantification and meta-programming quantification. We also investigate the relationship with concepts in intensional logic.
We present an extension of first-order logic to support such abstractions, and show that it allows writing expressions of knowledge that are elaboration tolerant. To avoid nonsensical sentences in this formalism, we refine the concept of well-formed sentences, and propose a method to verify well-formedness with a complexity that is linear with the number of tokens in the formula.
We have extended FO(.), a Knowledge Representation language, and IDP-Z3, a reasoning engine for FO(.), accordingly. We show that this extension was essential in accurately modelling various problem domains in an elaboration-tolerant way, i.e., without reification.
Fuzzy Quantification over OWL Ontologies and Knowledge Graphs
University of Zaragoza(萨拉戈萨大学);Aragon Institute of Engineering Research (I3A)(阿拉贡工程研究所 (I3A));University of Bari Aldo Moro(巴里阿尔多莫罗大学);CNR-ISTI(意大利国家研究委员会-信息科学与技术研究所)
Towards Analytics Aware Ontology Based Access to Static and Streaming Data (Extended Version)
University of Oxford(牛津大学);Athens University of Economics and Business(雅典经济与商业大学);University of Athens(雅典大学);University of Lübeck(吕贝克大学);Siemens Corporate Technology(西门子中央研究院)
SMI: Ontology-Grounded Semantic IDs for Hierarchy-Aware Medical Concept Representation
School of Electrical Engineering and Computer Science, Ohio University(俄亥俄大学电气与计算机工程学院);University of Southern California(南加利福尼亚大学);School of Computer Science, McGill University(麦吉尔大学计算机学院);Northwestern University(西北大学);University of Washington(华盛顿大学)
Answering Counting Queries over DL-Lite Ontologies
University of Bordeaux(波尔多大学);CNRS(法国国家科学研究中心);Bordeaux INP(波尔多国立理工学院);LaBRI(波尔多计算机科学研究实验室);Inria(法国国家信息与自动化研究所);DI ENS(巴黎高等师范学院计算机系);ENS(巴黎高等师范学院);University PSL(巴黎文理研究大学)