Derivation methods for hybrid knowledge bases with rules and ontologies

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia InformáticaFirst of all, I would like to thank my advisor, José Júlio Alferes, for his incredible support. Right from the start, during the first semester of this work, when we were 2700 km apart and meeting regularly via Skype, until the end of this dissertation, he was always committed and available for discussions, even when he had lots of other urgent things to do. A really special thanks to Terrance Swift, whom acted as an advisor, helping me a lot in the second implementation, and correcting all XSB’s and CDF’s bugs. This implementation wouldn’t surely have reached such a fruitful end without his support. I would also like to thank all my colleagues and friends at FCT for the great work environment and for not letting me take myself too serious. A special thanks to my colleagues from Dresden for encouraging me to work even when there were so many other interesting things to do as an Erasmus student. I’m indebted to Luís Leal, Bárbara Soares, Jorge Soares and Cecília Calado, who kindly accepted to read a preliminary version of this report and gave me their valuable comments. For giving me working conditions and a partial financial support, I acknowledge the Departamento de Informática of the Faculdade de Ciências e Tecnologias of Universidade Nova de Lisboa. Last, but definitely not least, I would like to thank my parents and all my family for their continuous encouragement and motivation. A special thanks to Bruno for his love, support and patience

Efficient paraconsistent reasoning with rules and ontologies for the semantic web

Ontologies formalized by means of Description Logics (DLs) and rules in the form of Logic Programs (LPs) are two prominent formalisms in the field of Knowledge Representation and Reasoning. While DLs adhere to the OpenWorld Assumption and are suited for taxonomic reasoning, LPs implement reasoning under the Closed World Assumption, so that default knowledge can be expressed. However, for many applications it is useful to have a means that allows reasoning over an open domain and expressing rules with exceptions at the same time. Hybrid MKNF knowledge bases make such a means available by formalizing DLs and LPs in a common logic, the Logic of Minimal Knowledge and Negation as Failure (MKNF). Since rules and ontologies are used in open environments such as the Semantic Web, inconsistencies cannot always be avoided. This poses a problem due to the Principle of Explosion, which holds in classical logics. Paraconsistent Logics offer a solution to this issue by assigning meaningful models even to contradictory sets of formulas. Consequently, paraconsistent semantics for DLs and LPs have been investigated intensively. Our goal is to apply the paraconsistent approach to the combination of DLs and LPs in hybrid MKNF knowledge bases. In this thesis, a new six-valued semantics for hybrid MKNF knowledge bases is introduced, extending the three-valued approach by Knorr et al., which is based on the wellfounded semantics for logic programs. Additionally, a procedural way of computing paraconsistent well-founded models for hybrid MKNF knowledge bases by means of an alternating fixpoint construction is presented and it is proven that the algorithm is sound and complete w.r.t. the model-theoretic characterization of the semantics. Moreover, it is shown that the new semantics is faithful w.r.t. well-studied paraconsistent semantics for DLs and LPs, respectively, and maintains the efficiency of the approach it extends

Every normal logic program has a 2-valued semantics: theory, extensions, applications, implementations

Trabalho apresentado no âmbito do Doutoramento em Informática, como requisito parcial para obtenção do grau de Doutor em InformáticaAfter a very brief introduction to the general subject of Knowledge Representation and Reasoning with Logic Programs we analyse the syntactic structure of a logic program and how it can influence the semantics. We outline the important properties of a 2-valued semantics for Normal Logic Programs, proceed to define the new Minimal Hypotheses semantics with those properties and explore how it can be used to benefit some knowledge representation and reasoning mechanisms. The main original contributions of this work, whose connections will be detailed in the sequel, are: • The Layering for generic graphs which we then apply to NLPs yielding the Rule Layering and Atom Layering — a generalization of the stratification notion; • The Full shifting transformation of Disjunctive Logic Programs into (highly nonstratified)NLPs; • The Layer Support — a generalization of the classical notion of support; • The Brave Relevance and Brave Cautious Monotony properties of a 2-valued semantics; • The notions of Relevant Partial Knowledge Answer to a Query and Locally Consistent Relevant Partial Knowledge Answer to a Query; • The Layer-Decomposable Semantics family — the family of semantics that reflect the above mentioned Layerings; • The Approved Models argumentation approach to semantics; • The Minimal Hypotheses 2-valued semantics for NLP — a member of the Layer-Decomposable Semantics family rooted on a minimization of positive hypotheses assumption approach; • The definition and implementation of the Answer Completion mechanism in XSB Prolog — an essential component to ensure XSB’s WAM full compliance with the Well-Founded Semantics; • The definition of the Inspection Points mechanism for Abductive Logic Programs;• An implementation of the Inspection Points workings within the Abdual system [21] We recommend reading the chapters in this thesis in the sequence they appear. However, if the reader is not interested in all the subjects, or is more keen on some topics rather than others, we provide alternative reading paths as shown below. 1-2-3-4-5-6-7-8-9-12 Definition of the Layer-Decomposable Semantics family and the Minimal Hypotheses semantics (1 and 2 are optional) 3-6-7-8-10-11-12 All main contributions – assumes the reader is familiarized with logic programming topics 3-4-5-10-11-12 Focus on abductive reasoning and applications.FCT-MCTES (Fundação para a Ciência e Tecnologia do Ministério da Ciência,Tecnologia e Ensino Superior)- (no. SFRH/BD/28761/2006

Intelligent assembly in flexible automation

This work investigates the automation of assembly cells and the need to incorporate sensor-guided decision techniques. The experience of industry in this area is examined by observing a real cell on the shop floor. From the collected data conclusions point to an alternative error interpretation which describes the successful completion rather than an enumeration of errors. A methodology for the description of the process in robotic assembly is developed. The constituent phases in handling components are identified as Feeding, Transport and Mating. Each phase has well defined characteristic properties which can be determined using appropriate sensing mechanisms. The mating phase is given special attention by proposing the method of information Spaces as a suitable frame work for sensor fusion and context directed interpretation. Thus the successful progress is described regarding any deviations as errors. They in turn can be interpreted in the context in which they were encountered and recovery is accomplished in the demonstration cell by operator taught routines. Where error repetition occurs, a simple look-up technique suffices to remove the need for another operator intervention. The required data structures and the implementation of the experimental cell are discussed. It is concluded from the results that the principle of knowledge-based assembly control exhibits an intelligent behaviour which contributes to an increase in the cell productivity. This method addresses only a part of the overall problem of assembly automation, but it has a central place in the system and could be extended to the complete system

SLX - A TOP-DOWN DERIVATION PROCEDURE FOR PROGRAMS WITH EXPLICIT NEGATION

authorsversionpublishe

From cancer gene expression to protein interaction: Interaction prediction, network reasoning and applications in pancreatic cancer

Microarray technologies enable scientists to identify co-expressed genes at large scale. However, the gene expression analysis does not show functional relationships between co-expressed genes. There is a demand for effective approaches to analyse gene expression data to enable biological discoveries that can lead to identification of markers or therapeutic targets of many diseases. In cancer research, a number of gene expression screens have been carried out to identify genes differentially expressed in cancerous tissue such as Pancreatic Ductal Adenocarcinoma (PDAC). PDAC carries very poor prognosis, it eludes early detection and is characterised by its aggressiveness and resistance to currently available therapies. To identify molecular markers and suitable targets, there exist a research effort that maps differentially expressed genes to protein interactions to gain an understanding at systems level. Such interaction networks have a complex interconnected structure, whose the understanding of which is not a trivial task. Several formal approaches use simulation to support the investigation of such networks. These approaches suffer from the missing knowledge concerning biological systems. Reasoning in the other hand has the advantage of dealing with incomplete and partial information of the network knowledge. The initial approach adopted was to provide an algorithm that utilises a network-centric approach to pancreatic cancer, by re-constructing networks from known interactions and predicting novel protein interactions from structural templates. This method was applied to a data set of co-expressed PDAC genes. To this end, structural domains for the gene products are identified by using threading which is a 3D structure prediction technique. Next, the Protein Structure Interaction Database (SCOPPI), a database that classifies and annotates domain interactions derived from all known protein structures, is used to find templates of structurally interacting domains. Moreover, a network of related biological pathways for the PDAC data was constructed. In order to reason over molecular networks that are affected by dysregulation of gene expression, BioRevise was implemented. It is a belief revision system where the inhibition behaviour of reactions is modelled using extended logic programming. The system computes a minimal set of enzymes whose malfunction explains the abnormal expression levels of observed metabolites or enzymes. As a result of this research, two complementary approaches for the analysis of pancreatic cancer gene expression data are presented. Using the first approach, the pathways found to be largely affected in pancreatic cancer are signal transduction, actin cytoskeleton regulation, cell growth and cell communication. The analysis indicates that the alteration of the calcium pathway plays an important role in pancreas specific tumorigenesis. Furthermore, the structural prediction method reveals ~ 700 potential protein-protein interactions from the PDAC microarray data, among them, 81 novel interactions such as: serine/threonine kinase CDC2L1 interacting with cyclin-dependent kinase inhibitor CDKN3 and the tissue factor pathway inhibitor 2 (TFPI2) interacting with the transmembrane protease serine 4 (TMPRSS4). These resulting genes were further investigated and some were found to be potential therapeutic markers for PDAC. Since TMPRSS4 is involved in metastasis formation, it is hypothesised that the upregulation of TMPRSS4 and the downregulation of its predicted inhibitor TFPI2 plays an important role in this process. The predicted protein-protein network inspired the analysis of the data from two other perspectives. The resulting protein-protein interaction network highlighted the importance of the co-expression of KLK6 and KLK10 as prognostic factors for survival in PDAC as well as the construction of a PDAC specific apoptosis pathway to study different effects of multiple gene silencing in order to reactivate apoptosis in PDAC. Using the second approach, the behaviour of biological interaction networks using computational logic formalism was modelled, reasoning over the networks is enabled and the abnormal behaviour of its components is explained. The usability of the BioRevise system is demonstrated through two examples, a metabolic disorder disease and a deficiency in a pancreatic cancer associated pathway. The system successfully identified the inhibition of the enzyme glucose-6-phosphatase as responsible for the Glycogen storage disease type I, which according to literature is known to be the main reason for this disease. Furthermore, BioRevise was used to model reaction inhibition in the Glycolysis pathway which is known to be affected by Pancreatic cancer