Modeling in the early stage of system analysis is critical for understanding stakeholders, their needs, problems, and different viewpoints. We advocate methods for early domain exploration which provoke iteration over captured knowledge, helping to guide elicitation, and facilitating early scoping and decision making. Specifically, we provide a framework to support interactive, iterative analys...

Curriculum planning for students in a university which offers full-time as well as part-time courses is not a trivial task and is complicated by the fact that students can enrol for modules at different levels concurrently. A prototype advisory support tool was developed to address the problems related to documentbased advising. The tool supports two interactive advice approaches – a top-down b...

In this paper, we address the problem of answering (unions of) conjunctive queries on Aboxes. We propose a backward-chaining query evaluation based on query expansion. Expanding a query consists of determining all the ways of deriving it from atoms built on some distinguished predicates.

In this paper we present a proof-of-concept implementation of Neural Theorem Provers (NTPs), end-to-end differentiable counterparts of discrete theorem provers that perform first-order inference on vector representations of symbols using function-free, possibly parameterized, rules. As such, NTPs follow a long tradition of neural-symbolic approaches to automated knowledge base inference, but di...

In many engineering problems, unknown parameters of a model are inferred in order to make predictions, to design controllers, or to optimize the model. When parameters are distributed (continuous) or very high-dimensional (discrete) and quantities of interest are low-dimensional, parameters need not be fully resolved to make accurate estimates of quantities of interest. In this work, we extend ...

We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as conjunctive query answering or entailment) undecidable. These rules, called ∀∃-rules, have the same logical form as tuple-generating dependencies in databases and as conceptual graph rules. The aim of this paper is to provide a clearer picture of the frontier b...

This paper focuses on a linguistic-valued temporal logic based reasoning formalism for dynamically modelling and merging information under uncertainty in some real world systems where the state of a system evolves over time and the transition through states depends on uncertain conditions. We provide forward and backward reasoning algorithms which, respectively, support simulation and query ans...

This poster paper presents the design and implementation of an RDFS reasoner based on a backward chaining approach and implemented on a clustered RDF triplestore. The system presented, called 4sr, uses 4store as base infrastructure. In order to achieve a highly scalable system we implemented the reasoning at the lowest level of the quad store, the bind operation. The bind operation in 4sr trave...

The construction of explanations is a key process in human understanding, having many applications for internal tasks such as learning through to external tasks such as diagnosis and image interpretation. In this paper we introduce ve orthogonal dimensions along which any explanation task can be characterised and show how their identiication gives rise to a new model of explanation construction...

Evaluating food quality is a complex process since it relies on numerous criteria historically grouped into four main types: nutritional, sensorial, practical and hygienic qualities. They may be completed by other emerging preoccupations such as the environmental impact, economic phenomena, etc. However, all these aspects of quality and their various components are not always compatible and the...