Research Publications

Poor adherence to prescribed treatment is a major factor contributing to tuberculosis patients developing drug resistance and failing treatment. Treatment adherence behaviour is influenced by diverse personal, cultural and socio-economic factors that vary between regions and communities. Decision network models can potentially be used to predict treatment adherence behaviour. However, determining the network structure (identifying the factors and their causal relations) and the conditional probabilities is a challenging task. To resolve the former we developed an ontology supported by current scientific literature to categorise and clarify the similarity and granularity of factors

@{158,
  author = {Olukunle Ogundele and Deshen Moodley and Chris Seebregts and Anban Pillay},
  title = {Building Semantic Causal Models to Predict Treatment Adherence for Tuberculosis Patients in Sub-Saharan Africa},
  abstract = {Poor adherence to prescribed treatment is a major factor contributing to tuberculosis patients developing drug resistance and failing treatment. Treatment adherence behaviour is influenced by diverse personal, cultural and socio-economic factors that vary between regions and communities. Decision network models can potentially be used to predict treatment adherence behaviour. However, determining the network structure (identifying the factors and their causal relations) and the conditional probabilities is a challenging task. To resolve the former we developed an ontology supported by current scientific literature to categorise and clarify the similarity and granularity of factors},
  year = {2014},
  journal = {4th International Symposium (FHIES 2014) and 6th International Workshop (SEHC 2014)},
  pages = {81-95},
  month = {17/07-18/07},
}

Formalized temporal attributes in temporal conceptual models, temporal EER model, using a temporal description logic language (DLRus). This ensured the full formalization of the temporal conceptual model, ERvt, which permits full reasoning on the model. These results permit the development of consistent temporal databases.

@phdthesis{112,
  author = {Nasubo Ongoma},
  title = {Formalising Temporal Attributes in Temporal Conceptual Data Models},
  abstract = {Formalized temporal attributes in temporal conceptual models, temporal EER model, using a temporal description logic language (DLRus). This ensured the full formalization of the temporal conceptual model, ERvt, which permits full reasoning on the model. These results permit the development of consistent temporal databases.},
  year = {2014},
  volume = {MSc},
}

Among the various proposals for defeasible reasoning for description logics, Rational Closure, a procedure originally defined for propositional logic, turns out to have a number of desirable properties. Not only it is computationally feasible, but it can also be implemented using existing classical reasoners. One of its drawbacks is that it can be seen as too weak from the inferential point of view. To overcome this limitation we introduce in this paper two extensions of Rational Closure: Basic Relevant Closure and Minimal Relevant Closure. As the names suggest, both rely on defining a version of relevance. Our formalisation of relevance in this context is based on the notion of a justification (a minimal subset of sentences implying a given sentence). This is, to our knowledge, the first proposal for defining defeasibility in terms of justifications—a notion that is well-established in the area of ontology debugging. Both Basic and Minimal Relevant Closure increase the inferential power of Rational Closure, giving back intuitive conclusions that cannot be obtained from Rational Closure. We analyse the properties and present algorithms for both Basic and Minimal Relevant Closure, and provide experimental results for both Basic Relevant Closure and Minimal Relevant Closure, comparing it with Rational Closure.

@{107,
  author = {Giovanni Casini and Tommie Meyer and Kody Moodley and Riku Nortjé},
  title = {Relevant Closure: A New Form of Defeasible Reasoning for Description Logics},
  abstract = {Among the various proposals for defeasible reasoning for description
logics, Rational Closure, a procedure originally defined for propositional logic,
turns out to have a number of desirable properties. Not only it is computationally
feasible, but it can also be implemented using existing classical reasoners. One
of its drawbacks is that it can be seen as too weak from the inferential point of
view. To overcome this limitation we introduce in this paper two extensions of
Rational Closure: Basic Relevant Closure and Minimal Relevant Closure. As the
names suggest, both rely on defining a version of relevance. Our formalisation
of relevance in this context is based on the notion of a justification (a minimal
subset of sentences implying a given sentence). This is, to our knowledge, the
first proposal for defining defeasibility in terms of justifications—a notion that
is well-established in the area of ontology debugging. Both Basic and Minimal
Relevant Closure increase the inferential power of Rational Closure, giving back
intuitive conclusions that cannot be obtained from Rational Closure. We analyse
the properties and present algorithms for both Basic and Minimal Relevant
Closure, and provide experimental results for both Basic Relevant Closure and
Minimal Relevant Closure, comparing it with Rational Closure.},
  year = {2014},
  journal = {JELIA 2014},
  pages = {92-106},
  month = {24/09-26/09},
  isbn = {978-3-319-11557-3},
}

One of the challenges in the Software Development Life Cycle (SDLC) is to ensure that the requirements that drive the development of a software system are correct. However, establishing unambiguous and error-free requirements is not a trivial problem. As part of the requirements phase of the SDLC, a conceptual model can be created which describes the objects, relationships and operations that are of importance to business. Such a conceptual model is often expressed as a UML class diagram. Recent research concerned with the formal validation of such UML class diagrams has focused on transforming UML class diagrams to various formalisms such as description logics. Description logics are desirable since they have reasoning support which can be used to show that a UML class diagram is consistent/inconsistent. Yet, even when a UML class diagram is consistent, it still does not address the problem of ensuring that a UML class diagram represents business requirements accurately. To validate such diagrams business analysts use a technique called scenario testing. In this paper we present an approach for the formal validation of UML class diagrams based on scenario testing. We additionally provide preliminary feedback on the experiences gained from using our scenario testing approach on a real-world software project.

@misc{106,
  author = {Henriette Harmse and Katarina Britz and Aurona Gerber and Deshen Moodley},
  title = {Scenario Testing using Formal Ontologies},
  abstract = {One of the challenges in the Software Development Life Cycle (SDLC) is to ensure that the requirements that drive the development of a software system are correct. However, establishing unambiguous and error-free requirements is not a trivial problem. As part of the requirements phase of the SDLC, a conceptual model can be created which describes the objects, relationships and operations that are of importance to business. Such a conceptual model is often expressed as a UML class diagram. Recent research concerned with the formal validation of such UML class diagrams has focused on transforming UML class diagrams to various formalisms such as description logics. Description logics are desirable since they have reasoning support which can be used to show that a UML class diagram is consistent/inconsistent. Yet, even when a UML class diagram is consistent, it still does not address the problem of ensuring that a UML class diagram represents business requirements accurately. To validate such diagrams business analysts use a technique called scenario testing. In this paper we present an approach for the formal validation of UML class diagrams based on scenario testing. We additionally provide preliminary feedback on the experiences gained from using our scenario testing approach on a real-world software project.},
  year = {2014},
  isbn = {urn:nbn:de:0074-1301-3},
  url = {http://ceur-ws.org/Vol-1301/ontocomodise2014_10.pdf},
}

The goal of this paper is to report on the development of an ontologybased taxonomic key application that is a first deliverable of a larger project that has as goal the development of ontology-driven computing solutions for problems experienced in taxonomy. The ontology-based taxonomic key was developed from a complex taxonomic data set, namely the Catalogue of Afrotropical Bees. The key is used to identify the genera of African bees and for this paper we developed an ontology-based application, that demonstrates that morphological key data can be captured effectively in a standardised format as an ontology, and furthermore, even though the ontology-based key provides the same identification results as the traditional key, this approach allows for several additional advantages that could support taxonomy in the biological sciences. The morphology ontology for Afrotropical bees, as well as the key application form the basis of a suite of tools that we intend to develop to support the taxonomic processes in this domain.

@inbook{101,
  author = {Aurona Gerber and C. Eardley and Nishal Morar},
  title = {An Ontology-based Key for Afrotropical Bees},
  abstract = {The goal of this paper is to report on the development of an ontologybased
taxonomic key application that is a first deliverable of a larger project that
has as goal the development of ontology-driven computing solutions for problems
experienced in taxonomy. The ontology-based taxonomic key was developed from
a complex taxonomic data set, namely the Catalogue of Afrotropical Bees. The
key is used to identify the genera of African bees and for this paper we developed
an ontology-based application, that demonstrates that morphological key data can
be captured effectively in a standardised format as an ontology, and furthermore,
even though the ontology-based key provides the same identification results as the
traditional key, this approach allows for several additional advantages that could
support taxonomy in the biological sciences. The morphology ontology for
Afrotropical bees, as well as the key application form the basis of a suite of tools
that we intend to develop to support the taxonomic processes in this domain.},
  year = {2014},
  journal = {Frontiers in Artificial Intelligence and Applications},
  pages = {277-288},
  publisher = {IOS Press},
  address = {Rio de Janeiro, Brazil},
  isbn = {978-1-61499-437-4 (print) | 978-1-61499-438-1 (online)},
  url = {http://ebooks.iospress.nl/volume/formal-ontology-in-information-systems-proceedings-of-the-eighth-international-conference-fois-2014},
}

The thesis reports on the development of a sequence of logics (formal languages based on mathematical logic) to deal with a class of uncertainty that agents may encounter. More accurately, the logics are meant to be used for allowing robots or software agents to reason about the uncertainty they have about the effects of their actions and the noisiness of their observations. The approach is to take the well-established formalism called the partially observable Markov decision process (POMDP) as an underlying formalism and then design a modal logic based on POMDP theory to allow an agent to reason with a knowledge-base (including knowledge about the uncertainties). First, three logics are designed, each one adding one or more important features for reasoning in the class of domains of interest (i.e., domains where stochastic action and sensing are considered). The final logic, called the Stochastic Decision Logic (SDL) combines the three logics into a coherent formalism, adding three important notions for reasoning about stochastic decision-theoretic domains: (i) representation of and reasoning about degrees of belief in a statement, given stochastic knowledge, (ii) representation of and reasoning about the expected future rewards of a sequence of actions and (iii) the progression or update of an agent’s epistemic, stochastic knowledge. For all the logics developed in this thesis, entailment is defined, that is, whether a sentence logically follows from a knowledge-base. Decision procedures for determining entailment are developed, and they are all proved sound, complete and terminating. The decision procedures all employ tableau calculi to deal with the traditional logical aspects, and systems of equations and inequalities to deal with the probabilistic aspects. Besides promoting the compact representation of POMDP models, and the power that logic brings to the automation of reasoning, the Stochastic Decision Logic is novel and significant in that it allows the agent to determine whether or not a set of sentences is entailed by an arbitrarily precise specification of a POMDP model, where this is not possible with standard POMDPs. The research conducted for this thesis has resulted in several publications and has been presented at several workshops, symposia and conferences.

@phdthesis{100,
  author = {Gavin Rens},
  title = {Formalisms for Agents Reasoning with Stochastic Actions and Perceptions},
  abstract = {The thesis reports on the development of a sequence of logics (formal languages based on mathematical logic) to deal with a class of uncertainty that agents may encounter. More accurately, the logics are meant to be used for allowing robots or software agents to reason about the uncertainty they have about the effects of their actions and the noisiness of their observations. The approach is to take the well-established formalism called the 
partially observable Markov decision process (POMDP) as an underlying formalism and then design a modal logic based on POMDP theory to allow an agent to reason with a knowledge-base (including knowledge about the uncertainties).

First, three logics are designed, each one adding one or more important features for reasoning in the class of domains of interest (i.e., domains where stochastic action and sensing are considered). The final logic, called the Stochastic Decision Logic (SDL) combines the three logics into a coherent formalism, adding three important notions for reasoning about stochastic decision-theoretic domains: (i) representation of and reasoning about degrees of belief in a statement, given stochastic knowledge, (ii) representation of and reasoning about the expected future rewards of a sequence of actions and (iii) the progression or update of an agent’s epistemic, stochastic knowledge.

For all the logics developed in this thesis, entailment is defined, that is, whether a sentence logically follows from a knowledge-base. Decision procedures for determining entailment are developed, and they are all proved sound, complete and terminating. The decision procedures all employ tableau calculi to deal with the traditional logical aspects, and systems of equations and inequalities to deal with the probabilistic aspects.

Besides promoting the compact representation of POMDP models, and the power that logic brings to the automation of reasoning, the Stochastic Decision Logic is novel and significant in that it allows the agent to determine whether or not a set of sentences is entailed by an arbitrarily precise specification of a POMDP model, where this is not possible with standard POMDPs.

The research conducted for this thesis has resulted in several publications and has been presented at several workshops, symposia and conferences.},
  year = {2014},
  volume = {PhD},
}

No Abstract

@phdthesis{99,
  author = {Nelia Lombard and Aurona Gerber and Alta van der Merwe},
  title = {The Construction and Use of an Ontology to Support a Simulation Environment Performing Countermeasure Evaluation for Military Aircraft},
  abstract = {No Abstract},
  year = {2014},
  volume = {MTech},
}

No Abstract

@inbook{98,
  author = {Marne de Vries and Aurona Gerber and Alta van der Merwe},
  title = {The Nature of the Enterprise Engineering Discipline},
  abstract = {No Abstract},
  year = {2014},
  publisher = {LNBIP Springer},
  url = {http://ciaonetwork.org/events/past-events/4th-enterprise-engineering-working-conference},
}

The development of drug resistance is a major factor imped- ing the efficacy of antiretroviral treatment of South Africa’s HIV infected population. While genotype resistance testing is the standard method to determine resistance, access to these tests is limited in low-resource set- tings. In this paper we investigate machine learning techniques for drug resistance prediction from routine treatment and laboratory data to help clinicians select patients for confirmatory genotype testing. The tech- niques, including binary relevance, HOMER, MLkNN, predictive clus- tering trees (PCT), RAkEL and ensemble of classifier chains were tested on a dataset of 252 medical records of patients enrolled in an HIV treat- ment failure clinic in rural KwaZulu-Natal in South Africa. The PCT method performed best with a discriminant power of 1.56 for two drugs, above 1.0 for three others and a mean true positive rate of 0.68. These methods show potential for application where access to genotyping is limited.

@{97,
  author = {Pascal Brandt and Deshen Moodley and Anban Pillay and Chris Seebregts and T. de Oliveira},
  title = {An Investigation of Classification Algorithms for Predicting HIV Drug Resistance Without Genotype Resistance Testing},
  abstract = {The development of drug resistance is a major factor imped- ing the efficacy of antiretroviral treatment of South Africa’s HIV infected population. While genotype resistance testing is the standard method to determine resistance, access to these tests is limited in low-resource set- tings. In this paper we investigate machine learning techniques for drug resistance prediction from routine treatment and laboratory data to help clinicians select patients for confirmatory genotype testing. The tech- niques, including binary relevance, HOMER, MLkNN, predictive clus- tering trees (PCT), RAkEL and ensemble of classifier chains were tested on a dataset of 252 medical records of patients enrolled in an HIV treat- ment failure clinic in rural KwaZulu-Natal in South Africa. The PCT method performed best with a discriminant power of 1.56 for two drugs, above 1.0 for three others and a mean true positive rate of 0.68. These methods show potential for application where access to genotyping is limited.},
  year = {2014},
  journal = {Third International Symposium on Foundations of Health Information Engineering and Systems},
  pages = {236-253},
  month = {21/08-23/08},
  isbn = {978-3-642-53955-8},
  url = {http://link.springer.com/chapter/10.1007/978-3-642-53956-5_16},
}

No Abstract

@misc{96,
  author = {Nasubo Ongoma},
  title = {Formalising Temporal Attributes in Temporal conceptual data models},
  abstract = {No Abstract},
  year = {2014},
}

We present a logic inspired by partially observable Markov decision process (POMDP) theory for specifying agent domains where the agent's actuators and sensors are noisy (causing uncertainty). The language features modalities for actions and predicates for observations. It includes a notion of probability to represent the uncertainties, and the expression of rewards and costs are also catered for. One of the main contributions of the paper is the formulation of a sound and complete decision procedure for checking validity of sentences: a tableau method which appeals to solving systems of equations. The tableau rules eliminate propositional connectives, then, for all open branches of the tableau tree, systems of equations are generated and checked for feasibility. This paper presents progress made on previously published work.

@{95,
  author = {Gavin Rens and Tommie Meyer and G. Lakemeyer},
  title = {A Logic for Specifying Stochastic Actions and Observations},
  abstract = {We present a logic inspired by partially observable Markov decision process (POMDP) theory for specifying agent domains where the agent's actuators and sensors are noisy (causing uncertainty). The language features modalities for actions and predicates for observations. It includes a notion of probability to represent the uncertainties, and the expression of rewards and costs are also catered for. One of the main contributions of the paper is the formulation of a sound and complete decision procedure for checking validity of sentences: a tableau method which appeals to solving systems of equations. The tableau rules eliminate propositional connectives, then, for all open branches of the tableau tree, systems of equations are generated and checked for feasibility. This paper presents progress made on previously published work.},
  year = {2014},
  journal = {Intl. Symposium on Foundations of Information and Knowledge Systems (FoIKS)},
  pages = {305-323},
  month = {03/03-07/03},
  isbn = {978-3-319-04938-0},
}

The sugarcane supply chain (from sugarcane grower to mill) have particular challenges. One of these is that the growers have to deliver their cane to the mill before its quality degrades. The sugarcane supply chain typically consists of many growers and a mill. Growers deliver their cane daily during the milling season; the amount of cane they deliver depends on their farm size. Growers make decisions about when to harvest the cane, and the number and type of trucks needed to deliver their cane. The mill wants a consistent cane supply over the milling season. Growers are sometimes affected long queue lengths at the mill when they offload their cane. A preliminary agent-based simulation model was developed to understand this complex system. The model inputs a number of growers, and the amount of cane they are to deliver over the milling season. The number of trucks needed by each grower is determined by the trip, loading and unloading times and the anticipated waiting time at the mill. The anticipated waiting time was varied to determine how many trucks would be needed in the system to deliver the week’s cane allocation. As the anticipated waiting time increased, the number of trucks needed also increased, which in turn delayed the trucks when queuing at the mill. The growers’ anticipated waiting times never matched the actual waiting times. The research shows the promise of agent-based models as a sense-making approach to understanding systems where there are many individuals who have autonomous behaviour, and whose actions and interactions can result in unexpected system-level behaviour.

@{94,
  author = {C. Sue Price and Deshen Moodley and C.N. Bezuidenhout},
  title = {Using agent-based simulation to explore sugarcane supply chain transport complexities at a mill scale},
  abstract = {The sugarcane supply chain (from sugarcane grower to mill) have particular challenges.  One of these is that the growers have to deliver their cane to the mill before its quality degrades.  The sugarcane supply chain typically consists of many growers and a mill.  Growers deliver their cane daily during the milling season; the amount of cane they deliver depends on their farm size.  Growers make decisions about when to harvest the cane, and the number and type of trucks needed to deliver their cane.  The mill wants a consistent cane supply over the milling season.  Growers are sometimes affected long queue lengths at the mill when they offload their cane.

A preliminary agent-based simulation model was developed to understand this complex system.  The model inputs a number of growers, and the amount of cane they are to deliver over the milling season.  The number of trucks needed by each grower is determined by the trip, loading and unloading times and the anticipated waiting time at the mill.  The anticipated waiting time was varied to determine how many trucks would be needed in the system to deliver the week’s cane allocation.  As the anticipated waiting time increased, the number of trucks needed also increased, which in turn delayed the trucks when queuing at the mill.   The growers’ anticipated waiting times never matched the actual waiting times.  The research shows the promise of agent-based models as a sense-making approach to understanding systems where there are many individuals who have autonomous behaviour, and whose actions and interactions can result in unexpected system-level behaviour.},
  year = {2014},
  journal = {43rd Annual Operations Research Society of South Africa Conference},
  pages = {88-96},
  month = {14/09-17/09},
  isbn = {978-1-86822-656-6},
}

South Africa has one of the highest HIV infection rates in the world with more than 5.6 million infected people and consequently has the largest antiretroviral treatment program with more than 1.5 million people on treatment. The development of drug resistance is a major factor impeding the efficacy of antiretroviral treatment. While genotype resistance testing (GRT) is the standard method to determine resistance, access to these tests is limited in resource-limited settings. This research investigates the efficacy of multi-label machine learning techniques at predicting HIV drug resistance from routine treatment and laboratory data. Six techniques, namely, binary relevance, HOMER, MLkNN, predictive clustering trees (PCT), RAkEL and ensemble of classifier chains (ECC) have been tested and evaluated on data from medical records of patients enrolled in an HIV treatment failure clinic in rural KwaZulu-Natal in South Africa. The performance is measured using five scalar evaluation measures and receiver operating characteristic (ROC) curves. The techniques were found to provide useful predictive information in most cases. The PCT and ECC techniques perform best and have true positive prediction rates of 97% and 98% respectively for specific drugs. The ECC method also achieved an AUC value of 0.83, which is comparable to the current state of the art. All models have been validated using 10 fold cross validation and show increased performance when additional data is added. In order to make use of these techniques in the field, a tool is presented that may, with small modifications, be integrated into public HIV treatment programs in South Africa and could assist clinicians to identify patients with a high probability of drug resistance.

@phdthesis{93,
  author = {Pascal Brandt and Deshen Moodley and Anban Pillay},
  title = {An Investigation Of Multi-label Classification Techniques For Predicting Hiv Drug Resistance In Resource-limited Settings},
  abstract = {South Africa has one of the highest HIV infection rates in the world with more than 5.6 million infected people and consequently has the largest antiretroviral treatment program with more than 1.5 million people on treatment. The development of drug resistance is a major factor impeding the efficacy of antiretroviral treatment. While genotype resistance testing (GRT) is the standard method to determine resistance, access to these tests is limited in resource-limited settings. This research investigates the efficacy of multi-label machine learning techniques at predicting HIV drug resistance from routine treatment and laboratory data. Six techniques, namely, binary relevance, HOMER, MLkNN, predictive clustering trees (PCT), RAkEL and ensemble of classifier chains (ECC) have been tested and evaluated on data from medical records of patients enrolled in an HIV treatment failure clinic in rural KwaZulu-Natal in South Africa. The performance is measured using five scalar evaluation measures and receiver operating characteristic (ROC) curves. The techniques were found to provide useful predictive information in most cases. The PCT and ECC techniques perform best and have true positive prediction rates of 97% and 98% respectively for specific drugs. The ECC method also achieved an AUC value of 0.83, which is comparable to the current state of the art. All models have been validated using 10 fold cross validation and show increased performance when additional data is added. In order to make use of these techniques in the field, a tool is presented that may, with small modifications, be integrated into public HIV treatment programs in South Africa and could assist clinicians to identify patients with a high probability of drug resistance.},
  year = {2014},
  volume = {MSc},
}

eHealth governance and regulation are necessary in low resource African countries to ensure effective and equitable use of health information technology and to realize national eHealth goals such as interoperability, adoption of standards and data integration. eHealth regulatory frameworks are under-developed in low resource settings, which hampers the progression towards coherent and effective national health information systems. Ontologies have the potential to clarify issues around interoperability and the effectiveness of different standards to deal with different aspects of interoperability. Ontologies can facilitate drafting, reusing, implementing and compliance testing of eHealth regulations. In this regard, we have developed an OWL ontology to capture key concepts and relations concerning interoperability and standards. The ontology includes an operational definition for interoperability and is an initial step towards the development of a knowledge representation modeling platform for eHealth regulation and governance.

@{92,
  author = {Deshen Moodley and Chris Seebregts and Anban Pillay and Tommie Meyer},
  title = {An Ontology for Regulating eHealth Interoperability in Developing African Countries},
  abstract = {eHealth governance and regulation are necessary in low resource African countries to ensure effective and equitable use of health information technology and to realize national eHealth goals such as interoperability, adoption of standards and data integration. eHealth regulatory frameworks are under-developed in low resource settings, which hampers the progression towards coherent and effective national health information systems. Ontologies have the potential to clarify issues around interoperability and the effectiveness of different standards to deal with different aspects of interoperability. Ontologies can facilitate drafting, reusing, implementing and compliance testing of eHealth regulations. In this regard, we have developed an OWL ontology to capture key concepts and relations concerning interoperability and standards. The ontology includes an operational definition for interoperability and is an initial step towards the development of a knowledge representation modeling platform for eHealth regulation and governance.},
  year = {2014},
  journal = {Foundations of Health Information Engineering and Systems, Revised and Selected Papers, Lecture Notes in Computer Science Volume 7789},
  pages = {107-124},
  month = {15/09},
  isbn = {978-3-642-53955-8},
}

Representing temporal data in conceptual data models and ontologies is required by various application domains. For it to be useful for modellers to represent the information precisely and reason over it, it is essential to have a language that is expressive enough to capture the required operational semantics of the time-varying information. Temporal modelling languages have little support for temporal attributes, if at all, yet attributes are a standard element in the widely used conceptual modelling languages such as EER and UML. This hiatus prevents one to utilise a complete temporal conceptual data model and keep track of evolving values of data and its interaction with temporal classes. A rich axiomatisation of fully temporised attributes is possible with a minor extension to the already very expressive description logic language DLRUS. We formalise the notion of transition of attributes, and their interaction with transition of classes. The transition specified for attributes are extension, evolution, and arbitrary quantitative extension.

@misc{91,
  author = {Nasubo Ongoma and Maria Keet and Tommie Meyer},
  title = {Transition Constraints for Temporal Attributes},
  abstract = {Representing temporal data in conceptual data models and ontologies
is required by various application domains. For it to be useful for modellers to
represent the information precisely and reason over it, it is essential to have a language
that is expressive enough to capture the required operational semantics of
the time-varying information. Temporal modelling languages have little support
for temporal attributes, if at all, yet attributes are a standard element in the widely
used conceptual modelling languages such as EER and UML. This hiatus prevents
one to utilise a complete temporal conceptual data model and keep track of
evolving values of data and its interaction with temporal classes. A rich axiomatisation
of fully temporised attributes is possible with a minor extension to the
already very expressive description logic language DLRUS. We formalise the
notion of transition of attributes, and their interaction with transition of classes.
The transition specified for attributes are extension, evolution, and arbitrary quantitative
extension.},
  year = {2014},
  journal = {27th International Workshop on Description Logics},
  month = {17/07 - 20/07},
  url = {http://ceur-ws.org/Vol-1193/paper_25.pdf},
}

The interpretation of financial data obtained from the accounting process for reporting purposes is regulated by financial accounting standards (FAS). The history and mechanisms used for the development of ʻThe Conceptual Framework for Financial Reporting’ (the Conceptual Framework) as well as the financial accounting standards resulted in impressive volumes of material that guides modern financial reporting practices, but unfortunately, as is often the case with textual manuscripts, it contains descriptions that are vague, inconsistent or ambiguous. As part of the on-going initiatives to improve International Financial Reporting Standards (IFRS), the International Accounting Standards Board (IASB) promotes the development of principle-based IFRS, which aim to address the problems of vagueness, inconsistency and ambiguity. This paper reports on the findings of a design science research (DSR) project that, as artefact, developed a first version ontology-based formal language representing the definitions of asset, liability and equity (the fundamental elements of the statement of financial position as defined in the Conceptual Framework) through the application of knowledge representation (ontology) techniques as used within computing. We suggest that this artefact may assist with addressing vagueness, inconsistencies and ambiguities within the definitions of the Conceptual Framework. Based on our findings, we include suggestions for the further development of a formal language and approach to assist the formulation of the Conceptual Framework. The project focuses on the Conceptual Framework for Financial Reporting after the incorporation of Phase A in the convergence project between the Financial Accounting Standards Board (FASB) and IASB.

@article{90,
  author = {Mathinus Gerber and Aurona Gerber and Alta van der Merwe},
  title = {An Analysis of Fundamental Concepts in the Conceptual Framework Using Ontology Technologies.},
  abstract = {The interpretation of financial data obtained from the accounting process for reporting purposes is regulated by financial accounting standards (FAS). The history and mechanisms used for the development of ʻThe Conceptual Framework for Financial Reporting’ (the Conceptual Framework) as well as the financial accounting standards resulted in impressive volumes of material that guides modern financial reporting practices, but unfortunately, as is often the case with textual manuscripts, it contains descriptions that are vague, inconsistent or ambiguous. As part of the on-going initiatives to improve International Financial Reporting Standards (IFRS), the International Accounting Standards Board (IASB) promotes the development of principle-based IFRS, which aim to address the problems of vagueness, inconsistency and ambiguity. 

This paper reports on the findings of a design science research (DSR) project that, as artefact, developed a first version ontology-based formal language representing the definitions of asset, liability and equity (the fundamental elements of the statement of financial position as defined in the Conceptual Framework) through the application of knowledge representation (ontology) techniques as used within computing. We suggest that this artefact may assist with addressing vagueness, inconsistencies and ambiguities within the definitions of the Conceptual Framework. Based on our findings, we include suggestions for the further development of a formal language and approach to assist the formulation of the Conceptual Framework. The project focuses on the Conceptual Framework for Financial Reporting after the incorporation of Phase A in the convergence project between the Financial Accounting Standards Board (FASB) and IASB.},
  year = {2014},
  journal = {SAJEMS - The South African Journal of Economic and Management Sciences},
  volume = {17},
  pages = {369-411},
  isbn = {2222-3436},
  url = {http://www.sajems.org/index.php/sajems/article/view/525/434},
}

The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90's. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid (though preliminary) theoretical foundation has already been established towards this aim. Despite this foundation, the generalisation of the propositional framework to DLs is not yet complete and there are multiple proposals for entailment in this context with no formal system for deciding between these. In addition, there are virtually no existing preferential reasoning implementations to speak of for DL-based ontologies. The goals of this PhD are to provide a complete generalisation of the preferential framework of KLM to the DL ALC, provide a formal understanding of the relationships between the multiple proposals for entailment in this context, and finally, to develop an accompanying defeasible reasoning system for DL-based ontologies with performance that is suitable for use in existing ontology development settings.

@{89,
  author = {Tommie Meyer and Kody Moodley and U. Sattler},
  title = {Practical Defeasible Reasoning for Description Logics},
  abstract = {The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90's. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid (though preliminary) theoretical foundation has already been established towards this aim. Despite this foundation, the generalisation of the propositional framework to DLs is not yet complete and there are multiple proposals for entailment in this context with no formal system for deciding between these. In addition, there are virtually no existing preferential reasoning implementations to speak of for DL-based ontologies. The goals of this PhD are to provide a complete generalisation of the preferential framework of KLM to the DL ALC, provide a formal understanding of the relationships between the multiple proposals for entailment in this context, and finally, to develop an accompanying defeasible reasoning system for DL-based ontologies with performance that is suitable for use in existing ontology development settings.},
  year = {2014},
  journal = {European Starting AI Researcher Symposium},
  pages = {191-200},
  month = {18/08-19/08},
  address = {Prague, Czech Republic},
  isbn = {978-1-61499-421-3},
}

No Abstract

@phdthesis{86,
  author = {Henno Gous and Aurona Gerber and C. Schutte},
  title = {Towards a reference architecture for integrated knowledge networks},
  abstract = {No Abstract},
  year = {2014},
  volume = {PhD},
}

The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90's. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid theoretical foundation has already been established towards this aim. Despite this foundation, and the fact that many of the desirable aspects of the approach generalise favourably to certain DLs, implementations thereof remain unpublished. We present a defeasible-reasoning system for OWL ontologies demonstrating that we need not devise new decision procedures for certain preferential DLs. Our reasoning procedures are composed purely of classical DL decision steps which allows us to immediately hinge upon existing OWL and DL systems for defeasible reasoning tool support.

@misc{84,
  author = {Kody Moodley and Tommie Meyer and U. Sattler},
  title = {DIP: A Defeasible-Inference Platform for OWL Ontologies},
  abstract = {The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90's. In recent years, there have been efforts to extend their framework to Description Logics (DLs) and a solid theoretical foundation has already been established towards this aim. Despite this foundation, and the fact that many of the desirable aspects of the approach generalise favourably to certain DLs, implementations thereof remain unpublished. We present a defeasible-reasoning system for OWL ontologies demonstrating that we need not devise new decision procedures for certain preferential DLs. Our reasoning procedures are composed purely of classical DL decision steps which allows us to immediately hinge upon existing OWL and DL systems for defeasible reasoning tool support.},
  year = {2014},
  isbn = {1613-0073},
  url = {http://ceur-ws.org/Vol-1193/paper_44.pdf},
}

We investigate the notion of dilation of a propositional theory based on neighbourhoods in a generalized approximation space.We take both a semantic and a syntactic approach in order to define a suitable notion of theory dilation in the context of approximate reasoning on the one hand, and a generalized notion of forgetting in propositional logic on the other hand. We place our work in the context of existing theories of approximation spaces and forgetting, and show that neighbourhoods obtained by combining collective and selective dilation provide a suitable semantic framework within which to reason computationally with uncertainty in a classical setting.

@misc{82,
  author = {Katarina Britz and Ivan Varzinczak},
  title = {Towards a Theory of Dilation},
  abstract = {We investigate the notion of dilation of a propositional theory based
on neighbourhoods in a generalized approximation space.We take both a semantic
and a syntactic approach in order to define a suitable notion of theory dilation
in the context of approximate reasoning on the one hand, and a generalized notion
of forgetting in propositional logic on the other hand. We place our work in
the context of existing theories of approximation spaces and forgetting, and show
that neighbourhoods obtained by combining collective and selective dilation provide
a suitable semantic framework within which to reason computationally with
uncertainty in a classical setting.},
  year = {2014},
  url = {http://ceur-ws.org/Vol-1205/},
}