Selecting Ontology Entailments for Presentation to Users

Peer reviewedPreprin

A Formal Dialogue Model for Ontology Authoring

Several research teams have proposed controlled fragments of English suitable for building ontologies for the Semantic Web. These Controlled Languages are typically employed in applications that allow users to compose texts through guided authoring; the sentences in the text are parsed and interpreted to obtain axioms in OWL. We investigate here a variant of this approach in which the user enters sentences one at a time through an instant messaging interface, and receives an immediate response in English from the authoring system before typing in the next sentence. Such an application can support a variety of dialogue moves by the user—not only assertions, but also retractions, questions, requests for explanation, and so forth—and for each, we need to define an appropriate set of responses for the authoring system. To illustrate the interest and complexity of this task, we develop a formal model for just one case: responses to an assertion

Knowledge-based Transfer Learning Explanation

Machine learning explanation can significantly boost machine learning's application in decision making, but the usability of current methods is limited in human-centric explanation, especially for transfer learning, an important machine learning branch that aims at utilizing knowledge from one learning domain (i.e., a pair of dataset and prediction task) to enhance prediction model training in another learning domain. In this paper, we propose an ontology-based approach for human-centric explanation of transfer learning. Three kinds of knowledge-based explanatory evidence, with different granularities, including general factors, particular narrators and core contexts are first proposed and then inferred with both local ontologies and external knowledge bases. The evaluation with US flight data and DBpedia has presented their confidence and availability in explaining the transferability of feature representation in flight departure delay forecasting.Comment: Accepted by International Conference on Principles of Knowledge Representation and Reasoning, 201

Aberdeen University Ontology Reuse Stack

Postprin

Model Theory and Entailment Rules for RDF Containers, Collections and Reification

An RDF graph is, at its core, just a set of statements consisting of subjects, predicates and objects. Nevertheless, since its inception practitioners have asked for richer data structures such as containers (for open lists, sets and bags), collections (for closed lists) and reification (for quoting and provenance). Though this desire has been addressed in the RDF primer and RDF Schema specification, they are explicitely ignored in its model theory. In this paper we formalize the intuitive semantics (as suggested by the RDF primer, the RDF Schema and RDF semantics specifications) of these compound data structures by two orthogonal extensions of the RDFS model theory (RDFCC for RDF containers and collections, and RDFR for RDF reification). Second, we give a set of entailment rules that is sound and complete for the RDFCC and RDFR model theories. We show that complexity of RDFCC and RDFR entailment remains the same as that of simple RDF entailment

The modular structure of an ontology: Atomic decomposition

Extracting a subset of a given ontology that captures all the ontology’s knowledge about a specified set of terms is a well-understood task. This task can be based, for instance, on locality-based modules. However, a single module does not allow us to understand neither topicality, connectedness, structure, or superfluous parts of an ontology, nor agreement between actual and intended modeling. The strong logical properties of locality-based modules suggest that the family of all such modules of an ontology can support comprehension of the ontology as a whole. However, extracting that family is not feasible, since the number of localitybased modules of an ontology can be exponential w.r.t. its size. In this paper we report on a new approach that enables us to efficiently extract a polynomial representation of the family of all locality-based modules of an ontology. We also describe the fundamental algorithm to pursue this task, and report on experiments carried out and results obtained.