In the domain of ontology design as well as in Knowledge Representation, modeling universals is a challenging problem.Most approaches that have addressed this problem rely on Description Logics (DLs) but many difficulties remain, due to under-constrained representation which reduces the inferences that can be drawn and further causes problems in expressiveness. In mathematical logic and program checking, type theories have proved to be appealing but, so far they have not been applied in the formalization of ontologies. To bridge this gap, (...) we present in this paper a theory for representing ontologies in a dependently typed framework which relies on strong formal foundations including both a constructive logic and a functional type system. The language of this theory defines in a precise way what ontological primitives such as classes, relations, properties, etc., and thereof roles, are. The first part of the paper details how these primitives are defined and used within the theory. In a second part, we focus on the formalization of the role primitive. A review of significant role properties leads to the specification of a role profile and most of the remaining work details through numerous examples, how the proposed theory is able to fully satisfy this profile. It is demonstrated that dependent types can model several non-trivial aspects of roles including a formal solution for generalization hierarchies, identity criteria for roles and other contributions. A discussion is given on how the theory is able to cope with many of the constraints inherent in a good role representation. (shrink)

Ontology is the philosophical discipline which aims to understand how things in the world are divided into categories and how these categories are related together. This is exactly what information scientists aim for in creating structured, automated representations, called 'ontologies,' for managing information in fields such as science, government, industry, and healthcare. Currently, these systems are designed in a variety of different ways, so they cannot share data with one another. They are often idiosyncratically structured, accessible only to those who (...) created them, and unable to serve as inputs for automated reasoning. This volume shows, in a nontechnical way and using examples from medicine and biology, how the rigorous application of theories and insights from philosophical ontology can improve the ontologies upon which information management depends. (shrink)

Tarski’s conceptual analysis of the notion of logical consequence is one of the pinnacles of the process of defining the metamathematical foundations of mathematics in the tradition of his predecessors Euclid, Frege, Russell and Hilbert, and his contemporaries Carnap, Gödel, Gentzen and Turing. However, he also notes that in defining the concept of consequence “efforts were made to adhere to the common usage of the language of every day life.” This paper addresses the issue of what relationship Tarski’s analysis, and (...) Béziau’s further generalization of it in universal logic, have to reasoning in the everyday lives of ordinary people from the cognitive processes of children through to those of specialists in the empirical and deductive sciences. It surveys a selection of relevant research in a range of disciplines providing theoretical and empirical studies of human reasoning, discusses the value of adopting a universal logic perspective, answers the questions posed in the call for this special issue, and suggests some specific research challenges. (shrink)

This accessible essay treats knowledge and belief in a usable and applicable way. Many of its basic ideas have been developed recently in Corcoran-Hamid 2014: Investigating knowledge and opinion. The Road to Universal Logic. Vol. I. Arthur Buchsbaum and Arnold Koslow, Editors. Springer. Pp. 95-126. http://www.springer.com/birkhauser/mathematics/book/978-3-319-10192-7 .

Implicit stochastic models, including both ‘deep neural networks’ (dNNs) and the more recent unsupervised foundational models, cannot be explained. That is, it cannot be determined how they work, because the interactions of the millions or billions of terms that are contained in their equations cannot be captured in the form of a causal model. Because users of stochastic AI systems would like to understand how they operate in order to be able to use them safely and reliably, there has emerged (...) a new field called ‘explainable AI’ (XAI). When we examine the XAI literature, however, it becomes apparent that its protagonists have redefined the term ‘explanation’ to mean something else, namely: ‘interpretation’. Interpretations are indeed sometimes possible, but we show that they give at best only a subjective understanding of how a model works. We propose an alternative to XAI, namely certified AI (CAI), and describe how an AI can be specified, realized, and tested in order to become certified. The resulting approach combines ontologies and formal logic with statistical learning to obtain reliable AI systems which can be safely used in technical applications. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

Logical analysis of the applicability of nominals (which are introduced by hybrid logic) in the formal descriptions of the world (within modern knowledge representation and semantics-based systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific [temporal and/or spacial] states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in description logic (DL) and a nominal can be related to each other?’. Based (...) on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, the paper will analyse hybridised fundamental world descriptions. The research will finally reach the idea that we can have a hybrid description logic based on the analysed concepts. (shrink)

In this paper we propose a computational framework aimed at extending the problem solving capabilities of cognitive artificial agents through the introduction of a novel, goal-directed, dynamic knowledge generation mechanism obtained via a non monotonic reasoning procedure. In particular, the proposed framework relies on the assumption that certain classes of problems cannot be solved by simply learning or injecting new external knowledge in the declarative memory of a cognitive artificial agent but, on the other hand, require a mechanism for the (...) automatic and creative re-framing, or re-formulation, of the available knowledge. We show how such mechanism can be obtained trough a framework of dynamic knowledge generation that is able to tackle the problem of commonsense concept combination. In addition, we show how such a framework can be employed in the field of cognitive architectures in order to overcome situations like the impasse in SOAR by extending the possible options of its subgoaling procedures. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of the combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC + TR, whose semantics is based on the notion of rational closure, as well as on the distributed semantics of probabilistic Description Logics, and is equipped with a cognitive heuristic used by humans for concept composition. We first extend the logic of typicality ALC + TR by typicality inclusions of the (...) form p :: T(C) v D, whose intuitive meaning is that “we believe with degree p about the fact that typical Cs are Ds”. As in the distributed semantics, we define different scenarios containing only some typicality inclusions, each one having a suitable probability. We then exploit such scenarios in order to ascribe typical properties to a concept C obtained as the combination of two prototypical concepts. We also show that reasoning in the proposed Description Logic is EXPTIME-complete as for the underlying standard Description Logic ALC. (shrink)

While representation learning techniques have shown great promise in application to a number of different NLP tasks, they have had little impact on the problem of ontology matching. Unlike past work that has focused on feature engineering, we present a novel representation learning approach that is tailored to the ontology matching task. Our approach is based on embedding ontological terms in a high-dimensional Euclidean space. This embedding is derived on the basis of a novel phrase retrofitting strategy through which semantic (...) similarity information becomes inscribed onto fields of pre-trained word vectors. The resulting framework also incorporates a novel outlier detection mechanism based on a denoising autoencoder that is shown to improve performance. An ontology matching system derived using the proposed framework achieved an F-score of 94% on an alignment scenario involving the Adult Mouse Anatomical Dictionary and the Foundational Model of Anatomy ontology (FMA) as targets. This compares favorably with the best performing systems on the Ontology Alignment Evaluation Initiative anatomy challenge. We performed additional experiments on aligning FMA to NCI Thesaurus and to SNOMED CT based on a reference alignment extracted from the UMLS Metathesaurus. Our system obtained overall F-scores of 93.2% and 89.2% for these experiments, thus achieving state-of-the-art results. (shrink)

ABSTRACT Quine insisted that the satisfaction of an open modalised formula by an object depends on how that object is described. Kripke's ‘objectual’ interpretation of quantified modal logic, whereby variables are rigid, is commonly thought to avoid these Quinean worries. Yet there remain residual Quinean worries for epistemic modality. Theorists have recently been toying with assignment-shifting treatments of epistemic contexts. On such views an epistemic operator ends up binding all the variables in its scope. One might worry that this yields (...) the undesirable result that any attempt to ‘quantify in’ to an epistemic environment is blocked. If quantifying into the relevant constructions is vacuous, then such views would seem hopelessly misguided and empirically inadequate. But a famous alternative to Kripke's semantics, namely Lewis' counterpart semantics, also faces this worry since it also treats the boxes and diamonds as assignment-shifting devices. As I'll demonstrate, the mere fact that a variable is bound is no obstacle to binding it. This provides a helpful lesson for those modelling de re epistemic contexts with assignment sensitivity, and perhaps leads the way toward the proper treatment of binding in both metaphysical and epistemic contexts: Kripke for metaphysical modality, Lewis for epistemic modality. (shrink)

The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the treatment of task-based clinical guidelines as a means for better understanding the relations between different clinical tasks, both within the framework of a single guideline and between related guidelines. We used as our starting point a DAML+OIL-based ontology for the WHO guideline for hypertension management, comparing this with related guidelines and (...) attempting to show that TGP provides a flexible and highly expressive basis for the manipulation of ontologies of a sort which might be useful in providing more adequate Computer Interpretable Guideline Models (CIGMs) in the future. (shrink)

El contenido de la obra se halla dividido en dos partes, una primera teórica y otra segunda práctica. En la primera parte se realiza una explicación analítica del ciberactivismo mientras que la segunda se centra en reflexiones sobre aspectos concretos que pudieran ser útiles para quien desee planificar alguna acción.

The combination of Fuzzy Logics and Description Logics has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. It has turned out, however, that in the presence of general concept inclusion axioms this extension is less straightforward than thought. In fact, a number of tableau algorithms claimed to deal correctly with fuzzy DLs with (...) GCIs have recently been shown to be incorrect. In this paper, we concentrate on fuzzy \, the fuzzy extension of the well-known DL \. We present a terminating, sound, and complete tableau algorithm for fuzzy \ with arbitrary continuous t-norms. Unfortunately, in the presence of GCIs, this algorithm does not yield a decision procedure for consistency of fuzzy \ ontologies since it uses as a sub-procedure a solvability test for a finitely represented, but possibly infinite, system of inequations over the real interval [0,1], which are built using the t-norm. In general, it is not clear whether this solvability problem is decidable for such infinite systems of inequations. This may depend on the specific t-norm used. In fact, we also show in this paper that consistency of fuzzy \ ontologies with GCIs is undecidable for the product t-norm. This implies, of course, that for the infinite systems of inequations produced by the tableau algorithm for fuzzy \ with product t-norm, solvability is in general undecidable. We also give a brief overview of recently obtained decidability results for fuzzy \ w.r.t. other t-norms. (shrink)

Statements about the behavior of biochemical entities (e.g., about the interaction between two proteins) abound in the literature on molecular biology and are increasingly becoming the targets of information extraction and text mining techniques. We show that an accurate analysis of the semantics of such statements reveals a number of ambiguities that have to be taken into account in the practice of biomedical ontology engineering: Such statements can not only be understood as event reporting statements, but also as ascriptions of (...) dispositions or tendencies that may or may not refer to collectives of interacting molecules or even to collectives of interaction events. (shrink)

An application of Narrative Knowledge Representation Language (NKRL) techniques on (declassified) ‘terrorism in Southern Philippines’ documents has been carried out in the context of the IST Parmenides project. This paper describes some aspects of this work: it is our belief, in fact, that the Knowledge Representation techniques and the Intelligent Information Retrieval tools used in this experiment can be of some interest also in an ‘Ontological Modelling of Legal Events and Legal Reasoning’ context.

Language understanding is one of the most important characteristics for human beings. As a pervasive phenomenon in natural language, metaphor is not only an essential thinking approach, but also an ingredient in human conceptual system. Many of our ways of thinking and experiences are virtually represented metaphorically. With the development of the cognitive research on metaphor, it is urgent to formulate a computational model for metaphor understanding based on the cognitive mechanism, especially with the view to promoting natural language understanding. (...) Many works have been done in pragmatics and cognitive linguistics, especially the discussions on metaphor understanding process in pragmatics and metaphor mapping representation in cognitive linguistics. In this paper, a theoretical framework for metaphor understanding based on the embodied mechanism of concept inquiry is proposed. Based on this framework, ontology is introduced as the knowledge representation method in metaphor understanding, and metaphor mapping is formulated as ontology mapping. In line with the conceptual blending theory, a revised conceptual blending framework is presented by adding a lexical ontology and context as the fifth mental space, and a metaphor mapping algorithm is proposed. (shrink)

In order to effectively communicate information, the choice of representation is important. Ideally, a chosen representation will aid readers in making desired inferences. In this paper, we develop the theory of observation: what it means for one statement to be observable from another. Using observability, we give a formal characterization of the observational advantages of one representation of information over another. By considering observational advantages, people will be able to make better informed choices of representations of information. To demonstrate the (...) benefit of observation and observational advantages, we apply these concepts to set theory and Euler diagrams. In particular, we can show that Euler diagrams have significant observational advantages over set theory. This formally justifies Larkin and Simon’s claim that “a diagram is worth ten thousand words”. (shrink)

Knowledge Representation and Reasoning (KR&R) is based on the idea that propositional content can be rigorously represented in formal languages long the province of logic, in such a way that these representations can be productively reasoned over by humans and machines; and that this reasoning can be used to produce knowledge-based systems (KBSs). As such, KR&R is a discipline conventionally regarded to range across parts of artificial intelligence (AI), computer science, and especially logic. This standard view of KR&R’s participating fields (...) is correct — but dangerously incomplete. The view is incomplete because, as we explain herein, sophisticated KR&R must rely heavily upon philosophy. Encapsulated, the reason is actually quite straightforward: Sophisticated KR&R must include the representation of not only simple properties, but also concepts that are routine in the formal sciences (theoretical computer science, mathematics, logic, game theory, etc.), and everyday socio-cognitive concepts like mendacity, deception, betrayal, and evil. Because in KR&R the representation of such concepts must be rigorous in order to enable machine reasoning (e.g., machine-generated and machine-checked proofs that a is lying to b) over them, philosophy, devoted as it is in no small part to supplying analyses of such concepts, is a crucial partner in the overall enterprise. To put the point another way: When the knowledge to be represented is such as to require lengthy formulas in expressive formal languages for that representation, philosophy must be involved in the game. In addition, insofar as the advance of KR&R must allow formalisms and processes for representing and reasoning over visual propositional content, philosophy will be a key contributor into the future. (shrink)

We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms.

In the context of the emerging Semantic Web and the quest for a common logical framework underpinning its architecture, the relation of rule-based languages such as Answer Set Programming (ASP) and ontology languages such as the Web Ontology Language (OWL) has attracted a lot of attention in the literature over the past years. With its roots in Deductive Databases and Datalog though, ASP shares much more commonality with another Semantic Web standard, namely the Simple Protocol and RDF Query Language (SPARQL). (...) In this paper, we take the recent approval of the SPARQL1.1 standard by the World Wide Web consortium (W3C) as an opportunity to introduce this standard to the Logic Programming community by providing a translation of SPARQL1.1 into ASP. In this translation, we explain and highlight peculiarities of the new W3C standard. Along the way, we survey existing literature on foundations of SPARQL and SPARQL1.1, and also combinations of SPARQL with ontology and rules languages. Thereby, apart from providing the means to implement and support SPARQL natively within Logic Programming engines and particularly ASP engines, we hope to pave the way for further research on a common logical framework for Semantic Web languages, including query languages, from an ASP point of view. (shrink)

Rules are a common symbolic model of knowledge. Rule-based systems share roots in cognitive science and artificial intelligence. In the former, they are mostly used in cognitive architectures; in the latter, they are developed in several domains including knowledge engineering and machine learning. This paper aims to give an overview of these issues with the focus on the current research perspective of artificial intelligence. Moreover, in this setting we discuss our results in the design of rule-based systems and their applications (...) in context-aware and business intelligence systems. (shrink)

It is almost universally acknowledged that first-order logic (FOL), with its clean, well-understood syntax and semantics, allows for the clear expression of philosophical arguments and ideas. Indeed, an argument or philosophical theory rendered in FOL is perhaps the cleanest example there is of “representing philosophy”. A number of prominent syntactic and semantic properties of FOL reflect metaphysical presuppositions that stem from its Fregean origins, particularly the idea of an inviolable divide between concept and object. These presuppositions, taken at face value, (...) reflect a significant metaphysical viewpoint, one that can in fact hinder or prejudice the representation of philosophical ideas and arguments. Philosophers have of course noticed this and have, accordingly, sought to alter or extend traditional FOL in novel ways to reflect a more flexible and egalitarian metaphysical standpoint. The purpose of this paper, however, is to document and discuss how similar “adaptations” to FOL—culminating in a standardized framework known as Common Logic —have evolved out of the more practical and applied encounter of FOL with the problem of representing, sharing, and reasoning upon information on the World Wide Web. (shrink)

Computational machineries dedicated to the attribution of legal responsibility should be based on (or, make use of) a stack of definitions relating the notion of legal responsibility to a number of suitably chosen causal notions. This paper presents a general analysis of legal responsibility and of causation in fact based on Hart and Honoré’s work. Some physical aspects of causation in fact are then treated within the “lite” version of DOLCE foundational ontology written in OWL-DL, a standard description logic for (...) the Semantic Web. (shrink)

Like modal logic, temporal logic, and description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoare triples. In this survey, we present similarities between separation logic as an assertion language and modal and temporal logics. Moreover, we (...) propose a selection of landmark results about decidability, complexity and expressive power. (shrink)

The state of computing science and, particularly, software engineering and knowledge engineering is generally considered immature. The best starting point for achieving a mature engineering discipline is a solid scientific theory, and the primary reason behind the immaturity in these fields is precisely that computing science still has no such agreed upon underlying theory. As theories in other fields of science do, this paper formally establishes the fundamental elements and postulates making up a first attempt at a theory in this (...) field, considering the features and peculiarities of computing science. The fundamental elements of this approach are informons and holons, and it is a general and comprehensive theory of software engineering and knowledge engineering that related disciplines (e.g., information systems) can particularise and/or extend to take benefit from it (Lakatos’ concepts of core theory and protective belt theories). (shrink)

We consider fragments of the relational logic RL(1) obtained by posing various constraints on the relational terms involving the operator of composition of relations. These fragments allow to express several non classical logics including modal and description logics. We show how relational dual tableaux can be employed to provide decision procedures for each of them.

In this paper we argue that Prior and Reichenbach are best viewed as allies, not antagonists. We do so by combining the central insights of Prior and Reichenbach in the framework of hybrid tense logic. This overcomes a well-known defect of Reichenbach’s tense schema, namely that it gives multiple representations to sentences in the future perfect and the future-in-the-past. It also makes it easy to define an iterative schema for tense that allows for multiple points of reference, a possibility noted (...) by Prior and demanded by Comrie, and we sketch how this schema can be generalized to a shift-and-restrict pattern in which special propositional symbols act as restrictors on the range of tense operators. (shrink)

Contains the following contributions: -/- Ingvar Johansson: Ontologies and Concepts. Two Proposals -/- Christopher Menzel: Reference Ontologies - Application Ontologies: Either/Or or Both/And? -/- Luc Schneider: Foundational Ontologies and the Realist Bias -/- Guenther Goerz, Kerstin Buecher, Bernd Ludwig, Frank-Peter Schweinberger, and Iman Thabet: Combining a Lexical Taxonomy with Domain Ontology in the Erlangen Dialogue System -/- Vim Vandenberghe, Burkhard Schafer, John Kingston: Ontology Modelling in the Legal Domain - Realism Without Revisionism -/- A Proposed Methodology for the Development of (...) Application-Based Formal Ontologies Eric Little . (shrink)