With the advent of social robots, precise accounts of an increasing number of social phenomena are called for. Although the phenomenon of secrets is an important part of everyday social situations, logical accounts of it can only be found, in a rather strict sense, within logical investigations of systems security. This paper is an attempt to formalize the logic of a commonsense notion of secrets as a contribution to ontologies of social and epistemological phenomena. We take a secret to be a five-way relation between a proposition, a group of secret-keepers, a group of nescients, a condition of secrecy, and a time point. A bare-bones notion of secrets is defined by providing necessary and sufficient conditions for said relation to hold. Special classes of secrets are then identified by considering an assortment of extra conditions. The logical language employed formalizes a classical account of belief and intention, a theory of groups, and a novel notion of revealing. In such a rich theory, interesting properties of secrets are proved.
{"title":"A Commonsense Theory of Secrets","authors":"Haythem O. Ismail, Merna Shafie","doi":"10.3233/faia200662","DOIUrl":"https://doi.org/10.3233/faia200662","url":null,"abstract":"With the advent of social robots, precise accounts of an increasing number of social phenomena are called for. Although the phenomenon of secrets is an important part of everyday social situations, logical accounts of it can only be found, in a rather strict sense, within logical investigations of systems security. This paper is an attempt to formalize the logic of a commonsense notion of secrets as a contribution to ontologies of social and epistemological phenomena. We take a secret to be a five-way relation between a proposition, a group of secret-keepers, a group of nescients, a condition of secrecy, and a time point. A bare-bones notion of secrets is defined by providing necessary and sufficient conditions for said relation to hold. Special classes of secrets are then identified by considering an assortment of extra conditions. The logical language employed formalizes a classical account of belief and intention, a theory of groups, and a novel notion of revealing. In such a rich theory, interesting properties of secrets are proved.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"66 1","pages":"77-91"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90397680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear how many infringements have taken place: does an infringement count for the artefact as a whole or for each source file of a computer program? To answer this question, it must first be established whether a computer program should be considered as an integral whole, a collection, or a mere set of distinct files, and why. We argue that a program is a functional whole, availing of, and combining, arguments from mereology, granularity, modularity, unity, and function to substantiate the claim. The argumentation and answer contributes to the ontology of software artefacts, may assist industry in litigation cases, and demonstrates that the notion of unifying relation is operationalisable.
{"title":"The Computer Program as a Functional Whole","authors":"C. Keet","doi":"10.3233/faia200673","DOIUrl":"https://doi.org/10.3233/faia200673","url":null,"abstract":"Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear how many infringements have taken place: does an infringement count for the artefact as a whole or for each source file of a computer program? To answer this question, it must first be established whether a computer program should be considered as an integral whole, a collection, or a mere set of distinct files, and why. We argue that a program is a functional whole, availing of, and combining, arguments from mereology, granularity, modularity, unity, and function to substantiate the claim. The argumentation and answer contributes to the ontology of software artefacts, may assist industry in litigation cases, and demonstrates that the notion of unifying relation is operationalisable.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"24 1","pages":"216-230"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78450358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The near ubiquity of family relationship ontologies in the Semantic Web has brought on the question of whether any formal analysis has been done in this domain. This paper examines kinship relationships that are normally overlooked in formal analyses of domain-specific ontologies: how are such ontologies verified and validated? We draw inspiration from existing work done in anthropology, where attempts have been made to formally model kinship as atemporal algebraic models. Based on these algebraic models, we provide an ontology for kinship written in first-order logic and demonstrate how the ontology can be used to validate definitions found in Canadian legal laws and data collection documentation.
{"title":"An Ontology for Formal Models of Kinship","authors":"Carmen S. Chui, M. Gruninger, Janette Wong","doi":"10.3233/faia200663","DOIUrl":"https://doi.org/10.3233/faia200663","url":null,"abstract":"The near ubiquity of family relationship ontologies in the Semantic Web has brought on the question of whether any formal analysis has been done in this domain. This paper examines kinship relationships that are normally overlooked in formal analyses of domain-specific ontologies: how are such ontologies verified and validated? We draw inspiration from existing work done in anthropology, where attempts have been made to formally model kinship as atemporal algebraic models. Based on these algebraic models, we provide an ontology for kinship written in first-order logic and demonstrate how the ontology can be used to validate definitions found in Canadian legal laws and data collection documentation.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"8 1","pages":"92-106"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81582021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Barton, Fumiaki Toyoshima, L. Vieu, P. Fabry, J. Éthier
This article provides the basis of a formal axiomatic system for a mereology of informational entities based on the idea of information fillers that can occupy information slots, such as the same word that can be used in different sentences. It is inspired by Karen Bennett’s mereological system that enables a whole to have a part “twice over”, but differs from it in several key points, such as the acceptance of empty slots, and the possibility for slots to have slots. Information slots are analyzed as informational entities that can carry aboutness.
{"title":"The Mereological Structure of Informational Entities","authors":"A. Barton, Fumiaki Toyoshima, L. Vieu, P. Fabry, J. Éthier","doi":"10.3233/faia200672","DOIUrl":"https://doi.org/10.3233/faia200672","url":null,"abstract":"This article provides the basis of a formal axiomatic system for a mereology of informational entities based on the idea of information fillers that can occupy information slots, such as the same word that can be used in different sentences. It is inspired by Karen Bennett’s mereological system that enables a whole to have a part “twice over”, but differs from it in several key points, such as the acceptance of empty slots, and the possibility for slots to have slots. Information slots are analyzed as informational entities that can carry aboutness.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"93 1","pages":"201-215"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83338537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Use and reuse of an ontology requires prior ontology verification which encompasses, at least, proving that the ontology is internally consistent and consistent with representative datasets. First-order logic (FOL) model finders are among the only available tools to aid us in this undertaking, but proving consistency of FOL ontologies is theoretically intractable while also rarely succeeding in practice, with FOL model finders scaling even worse than FOL theorem provers. This issue is further exacerbated when verifying FOL ontologies against datasets, which requires constructing models with larger domain sizes. This paper presents a first systematic study of the general feasibility of SAT-based model finding with FOL ontologies. We use select spatial ontologies and carefully controlled synthetic datasets to identify key measures that determine the size and difficulty of the resulting SAT problems. We experimentally show that these measures are closely correlated with the runtimes of Vampire and Paradox, two state-of-the-art model finders. We propose a definition elimination technique and demonstrate that it can be a highly effective measure for reducing the problem size and improving the runtime and scalability of model finding.
{"title":"Model-Finding for Externally Verifying FOL Ontologies: A Study of Spatial Ontologies","authors":"Shirly Stephen, T. Hahmann","doi":"10.3233/faia200675","DOIUrl":"https://doi.org/10.3233/faia200675","url":null,"abstract":"Use and reuse of an ontology requires prior ontology verification which encompasses, at least, proving that the ontology is internally consistent and consistent with representative datasets. First-order logic (FOL) model finders are among the only available tools to aid us in this undertaking, but proving consistency of FOL ontologies is theoretically intractable while also rarely succeeding in practice, with FOL model finders scaling even worse than FOL theorem provers. This issue is further exacerbated when verifying FOL ontologies against datasets, which requires constructing models with larger domain sizes. This paper presents a first systematic study of the general feasibility of SAT-based model finding with FOL ontologies. We use select spatial ontologies and carefully controlled synthetic datasets to identify key measures that determine the size and difficulty of the resulting SAT problems. We experimentally show that these measures are closely correlated with the runtimes of Vampire and Paradox, two state-of-the-art model finders. We propose a definition elimination technique and demonstrate that it can be a highly effective measure for reducing the problem size and improving the runtime and scalability of model finding.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"5 1","pages":"233-248"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82119308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The General Formal Ontology (GFO) is a top-level ontology that has been developed by the Onto-Med Research Group since the early 2000s. Since that time several new theoretical results have been achieved as well as numerous projects have utilized the ontology, especially in complex domains such as bioinformatics and medical computer science. This leads to the need for an up-to-date overview of GFO and access to its applications. This paper represents the first step towards introducing the GFO 2.0 framework, which aims at the integration of the work that is already present, but scattered in various publications, and its provision as a ready-to-use and reusable framework. For this purpose we summarize key features of GFO so far, outline a novel modular architecture and survey first modules for GFO 2.0, linking to applications. Finally, a rigorous and systematic development process is indicated.
{"title":"Towards GFO 2.0: Architecture, Modules and Applications","authors":"P. Burek, F. Loebe, H. Herre","doi":"10.3233/faia200658","DOIUrl":"https://doi.org/10.3233/faia200658","url":null,"abstract":"The General Formal Ontology (GFO) is a top-level ontology that has been developed by the Onto-Med Research Group since the early 2000s. Since that time several new theoretical results have been achieved as well as numerous projects have utilized the ontology, especially in complex domains such as bioinformatics and medical computer science. This leads to the need for an up-to-date overview of GFO and access to its applications. This paper represents the first step towards introducing the GFO 2.0 framework, which aims at the integration of the work that is already present, but scattered in various publications, and its provision as a ready-to-use and reusable framework. For this purpose we summarize key features of GFO so far, outline a novel modular architecture and survey first modules for GFO 2.0, linking to applications. Finally, a rigorous and systematic development process is indicated.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"32 1","pages":"32-45"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82125512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Emilio M. Sanfilippo, Béatrice Bouchou-Markhoff, Perrine Pittet
The CIDOC-CRM ontology is a standard for cultural heritage data modeling. Despite its large exploitation, the ontology is primarily maintained in a semiformal notation, which makes it difficult to homogeneously exploit it in digital environments. In addition, the ontology consists of several classes and relations, whereas one sometimes wishes to reuse it but only partially. The purpose of the paper is to contribute to the use of CIDOC by strengthening its foundations. On the basis of formal ontology theories, we propose a first analysis of the ontology to enhance its conceptual structure. We also present a preliminary modularization of CIDOC aimed at enhancing both its formalization and usage.
{"title":"Ontological Analysis and Modularization of CIDOC-CRM","authors":"Emilio M. Sanfilippo, Béatrice Bouchou-Markhoff, Perrine Pittet","doi":"10.3233/faia200664","DOIUrl":"https://doi.org/10.3233/faia200664","url":null,"abstract":"The CIDOC-CRM ontology is a standard for cultural heritage data modeling. Despite its large exploitation, the ontology is primarily maintained in a semiformal notation, which makes it difficult to homogeneously exploit it in digital environments. In addition, the ontology consists of several classes and relations, whereas one sometimes wishes to reuse it but only partially. The purpose of the paper is to contribute to the use of CIDOC by strengthening its foundations. On the basis of formal ontology theories, we propose a first analysis of the ontology to enhance its conceptual structure. We also present a preliminary modularization of CIDOC aimed at enhancing both its formalization and usage.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"13 1","pages":"107-121"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72995607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Persistence is about how things behave across time. It is generally discussed in terms of endurantism (three-dimensionalism) and perdurantism (four-dimensionalism). Despite the relevance of persistence to ontological modeling, however, there is no clear consensus over how to characterize precisely those two theories of persistence. This paper takes the initial steps towards a foundation for ontology of persistence. In particular, I examine by employing recent findings from philosophy of persistence how some major upper ontologies conceptualize endurantism and perdurantism. My resulting modest suggestion is that formal-ontological discussion on persistence should be updated by expanding its perspective beyond the topic of whether objects have proper temporal parts or not.
{"title":"Foundations for Ontology of Persistence: Beyond Talk of Temporal Parts","authors":"Fumiaki Toyoshima","doi":"10.3233/faia200657","DOIUrl":"https://doi.org/10.3233/faia200657","url":null,"abstract":"Persistence is about how things behave across time. It is generally discussed in terms of endurantism (three-dimensionalism) and perdurantism (four-dimensionalism). Despite the relevance of persistence to ontological modeling, however, there is no clear consensus over how to characterize precisely those two theories of persistence. This paper takes the initial steps towards a foundation for ontology of persistence. In particular, I examine by employing recent findings from philosophy of persistence how some major upper ontologies conceptualize endurantism and perdurantism. My resulting modest suggestion is that formal-ontological discussion on persistence should be updated by expanding its perspective beyond the topic of whether objects have proper temporal parts or not.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"91 1","pages":"17-31"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83766950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper outlines a conceptual framework to identify all ontological and logical aspects relevant for the debate over structural universals. The framework allows for a multi-facetted classifications of various accounts of the latter and facilitates their comparison in a systematic way. To show the framework in action I use it to classify all major theoretical positions in this debate.
{"title":"An Analysis of the Debate over Structural Universals","authors":"P. Garbacz","doi":"10.3233/faia200656","DOIUrl":"https://doi.org/10.3233/faia200656","url":null,"abstract":"The paper outlines a conceptual framework to identify all ontological and logical aspects relevant for the debate over structural universals. The framework allows for a multi-facetted classifications of various accounts of the latter and facilitates their comparison in a systematic way. To show the framework in action I use it to classify all major theoretical positions in this debate.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"52 1","pages":"3-16"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73333602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Classical mereology is based on the assumption that any two underlapping elements have a sum, yet there are many domains (such as manufacturing assemblies, molecular structure, gene sequences, and convex time intervals) in which this assumption is not valid. In such domains, mereological sums must be connected objects. However, there has been little work in providing an axiomatization of such a mereology. Based on the observation that the underlying structures in these domains are represented by graphs, we propose a new mereotopology that axiomatizes the connected induced subgraph containment ordering for a graph, and then identify an axiomatization of the mereology that is a module of the mereotopology.
{"title":"A Mereology for Connected Structures","authors":"M. Gruninger, Carmen S. Chui, Yi Ru, Jona Thai","doi":"10.3233/faia200670","DOIUrl":"https://doi.org/10.3233/faia200670","url":null,"abstract":"Classical mereology is based on the assumption that any two underlapping elements have a sum, yet there are many domains (such as manufacturing assemblies, molecular structure, gene sequences, and convex time intervals) in which this assumption is not valid. In such domains, mereological sums must be connected objects. However, there has been little work in providing an axiomatization of such a mereology. Based on the observation that the underlying structures in these domains are represented by graphs, we propose a new mereotopology that axiomatizes the connected induced subgraph containment ordering for a graph, and then identify an axiomatization of the mereology that is a module of the mereotopology.","PeriodicalId":90829,"journal":{"name":"Formal ontology in information systems : proceedings of the ... International Conference. FOIS (Conference)","volume":"28 1","pages":"171-185"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87747001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：