We describe a prototype that performs structure-based classification of molecular structures. The software we present implements a sound and com- plete reasoning procedure of a formalism that extends logic programming and builds upon the DLV deductive databases system. We capture a wide range of chemical classes that are not expressible with OWL-based formalisms such as cyclic molecules, saturated molecules and alkanes. In terms of performance, a no- ticeable improvement is observed in comparison with previous approaches. Our evaluation has discovered subsumptions that are missing from the the manually curated ChEBI ontology as well as discrepancies with respect to existing subclass relations. We illustrate thus the potential of an ontology language which is suit- able for the Life Sciences domain and exhibits an encouraging balance between expressive power and practical feasibility.
Modelling Structured Domains with Description Graphs and Logic ProgrammingDespoina Magka
This document outlines a method for modeling structured domains like molecules and chemical entities using description graphs and logic programming. It discusses limitations of representing cyclic structures like chemical rings in OWL and proposes an extension called Description Graph Logic Programs (DGLPs) that uses description graphs and logic programming semantics. DGLPs provide an expressive yet decidable logic-based formalism that can represent all cycles using a closed-world assumption, addressing issues in modeling domains with complex interconnected structures in OWL.
1. The document summarizes key concepts from a lecture on alkenes, including their structure, bonding properties, and reactions. It discusses molecular orbital theory and frontier orbital theory as applied to alkenes.
2. Acid-base chemistry concepts are also covered, including Brønsted-Lowry definitions of acids and bases, proton transfer reactions, and factors that influence acidity such as electronegativity and resonance effects. Common acids and their pKa values are listed.
3. Frontier molecular orbital theory is used to predict reactions between reactants by identifying their HOMO and LUMO orbitals and showing curved arrow mechanisms. The roles of acids/bases and electrophiles/nucleophiles
1. The reaction between manganese dioxide (MnO2) and hydrochloric acid (HCl) is represented by the equation: MnO2 + 4HCl → MnCl2 + 2H2O + Cl2.
2. In the reaction, hydrochloric acid (HCl) is oxidized while manganese dioxide (MnO2) is reduced.
3. Manganese dioxide (MnO2) acts as the oxidizing agent by accepting electrons, while hydrochloric acid (HCl) acts as the reducing agent by donating electrons.
The document provides examples of calculations involving atomic structure including:
- Calculating the number of atoms that could fit across a penny based on atomic diameters
- Writing chemical symbols for ions and isotopes
- Predicting ionic charges
- Writing formulas for ionic and molecular compounds from element names or vice versa
- Naming acids based on their formulas
The examples illustrate various concepts and calculations involving atomic and molecular structure, isotopes, ions, and naming chemical compounds.
The document provides definitions, equations, and other information related to chemistry. It includes a glossary defining key terms such as Avogadro's constant, molar mass, amount of substance, mole, empirical formula, and molecular formula. It also includes common ion formulas and equations for acid-base reactions and combustion. The document appears to be aimed at providing a concise reference for chemistry concepts and calculations needed for an exam.
Ch. 3 elements and the periodic table(sec.1,2and 3)Hamdy Karim
The document describes the structure of atoms including protons, neutrons, and electrons, and how they are arranged in the nucleus and electron shells. It also explains how elements are organized in the periodic table according to their atomic number and properties, with metals generally on the left side and non-metals on the right. Different groups of elements are discussed including their typical properties and common uses.
Modelling Structured Domains with Description Graphs and Logic ProgrammingDespoina Magka
This document outlines a method for modeling structured domains like molecules and chemical entities using description graphs and logic programming. It discusses limitations of representing cyclic structures like chemical rings in OWL and proposes an extension called Description Graph Logic Programs (DGLPs) that uses description graphs and logic programming semantics. DGLPs provide an expressive yet decidable logic-based formalism that can represent all cycles using a closed-world assumption, addressing issues in modeling domains with complex interconnected structures in OWL.
1. The document summarizes key concepts from a lecture on alkenes, including their structure, bonding properties, and reactions. It discusses molecular orbital theory and frontier orbital theory as applied to alkenes.
2. Acid-base chemistry concepts are also covered, including Brønsted-Lowry definitions of acids and bases, proton transfer reactions, and factors that influence acidity such as electronegativity and resonance effects. Common acids and their pKa values are listed.
3. Frontier molecular orbital theory is used to predict reactions between reactants by identifying their HOMO and LUMO orbitals and showing curved arrow mechanisms. The roles of acids/bases and electrophiles/nucleophiles
1. The reaction between manganese dioxide (MnO2) and hydrochloric acid (HCl) is represented by the equation: MnO2 + 4HCl → MnCl2 + 2H2O + Cl2.
2. In the reaction, hydrochloric acid (HCl) is oxidized while manganese dioxide (MnO2) is reduced.
3. Manganese dioxide (MnO2) acts as the oxidizing agent by accepting electrons, while hydrochloric acid (HCl) acts as the reducing agent by donating electrons.
The document provides examples of calculations involving atomic structure including:
- Calculating the number of atoms that could fit across a penny based on atomic diameters
- Writing chemical symbols for ions and isotopes
- Predicting ionic charges
- Writing formulas for ionic and molecular compounds from element names or vice versa
- Naming acids based on their formulas
The examples illustrate various concepts and calculations involving atomic and molecular structure, isotopes, ions, and naming chemical compounds.
The document provides definitions, equations, and other information related to chemistry. It includes a glossary defining key terms such as Avogadro's constant, molar mass, amount of substance, mole, empirical formula, and molecular formula. It also includes common ion formulas and equations for acid-base reactions and combustion. The document appears to be aimed at providing a concise reference for chemistry concepts and calculations needed for an exam.
Ch. 3 elements and the periodic table(sec.1,2and 3)Hamdy Karim
The document describes the structure of atoms including protons, neutrons, and electrons, and how they are arranged in the nucleus and electron shells. It also explains how elements are organized in the periodic table according to their atomic number and properties, with metals generally on the left side and non-metals on the right. Different groups of elements are discussed including their typical properties and common uses.
Classifying Chemicals with Description Graphs and Logic ProgrammingDespoina Magka
OWL 2 is widely used to describe complex objects such as chemical molecules; however, OWL 2 axioms cannot represent `structural' features of chemical entities such as having a ring. A combination of OWL 2, rules and \emph{description graphs} (DGs) has been suggested as a possible solution, but an attempt to apply this formalism in a chemical Semantic Web application has revealed several drawbacks. Based on this experience, we present a radically different approach to modelling complex objects via a novel formalism that we call Description Graph Logic Programs. At the syntactic level, our approach combines DGs, rules, and OWL 2 RL axioms, but we give semantics to our formalism via a translation into logic programs interpreted under stable model semantics. The result is an expressive formalism that is well suited for modelling objects with complex structure, that captures the OWL 2 RL profile, and that thus fits naturally into the Semantic Web landscape. Additionally, we test the practical feasibility of our approach by means of a prototypical implementation which provides encouraging results.
Acyclicity Conditions and their Application to Query Answering in Description...Despoina Magka
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a key problem in knowledge representation and databases. This problem can be solved using the chase (aka materialisation) algorithm; however, CQ answering is undecidable for general existential rules, so the chase is not guaranteed to terminate. Several acyclicity conditions provide sufficient conditions for chase termination. In this paper, we present two novel such conditions—modelfaithful acyclicity (MFA) and model-summarising acyclicity (MSA)—that generalise many of the acyclicity conditions known so far in the literature. Materialisation provides the basis for several widely-used OWL 2 DL reasoners. In order to avoid termination problems, many of these systems handle only the OWL 2 RL profile of OWL 2 DL; furthermore, some systems go beyond OWL 2 RL, but they provide no termination guarantees. In this paper we investigate whether various acyclicity conditions can provide a principled and practical solution to these problems. On the theoretical side, we show that query answering for acyclic ontologies is of lower complexity than for general ontologies. On the practical side, we show that many of the commonly used OWL 2 DL ontologies are MSA, and that the facts obtained via materialisation are not too large. Thus, our results suggest that principled extensions to materialisationbased OWL 2 DL reasoners may be practically feasible.
Tractable Extensions of the Description Logic EL with Numerical DatatypesDespoina Magka
We consider extensions of the lightweight description logic (DL) EL with numerical datatypes such as naturals, integers, rationals and reals equipped with relations such as equality and inequalities. It is well-known that the main reasoning problems for such DLs are decid- able in polynomial time provided that the datatypes enjoy the so-called convexity property. Unfortunately many combinations of the numerical relations violate convexity, which makes the usage of these datatypes rather limited in practice. In this paper, we make a more fine-grained complexity analysis of these DLs by considering restrictions not only on the kinds of relations that can be used in ontologies but also on their occurrences, such as allowing certain relations to appear only on the left- hand side of the axioms. To this end, we introduce a notion of safety for a numerical datatype with restrictions (NDR) which guarantees tractabil- ity, extend the EL reasoning algorithm to these cases, and provide a complete classification of safe NDRs for natural numbers, integers, ra- tionals and reals.
Computing Stable Models for Nonmonotonic Existential RulesDespoina Magka
We consider function-free existential
rules extended with nonmonotonic negation under
a stable model semantics. We present new acyclicity and stratification conditions that identify a large
class of rule sets having finite, unique stable models, and we show how the addition of constraints on
the input facts can further extend this class. Checking these conditions is computationally feasible,
and we provide tight complexity bounds. Finally,
we demonstrate how these new methods allowed
us to solve relevant reasoning problems over a real-world knowledge base from biochemistry using an
off-the-shelf answer set programming engine.
This thesis examines the use of nonmonotonic existential rules for knowledge representation of structured entities. Chapter 1 introduces logical formalisms for knowledge representation such as description logics and rule-based systems. It outlines key features needed for an ontology language and previews the thesis structure. Chapter 2 defines the syntax and stable model semantics of nonmonotonic existential rules. It discusses reasoning tasks and computational complexity. The thesis goes on to analyze the use of existential rules for modeling structured objects, define acyclicity conditions for ensuring finite stable models, introduce stratication conditions for ensuring unique stable models, and extend these results to rules with constraints. It presents an ontology for chemistry in existential rules and evaluates an implementation on classifying
This work introduces faceted service discovery. It uses the Programmable Web directory as its corpus of APIs and enhances the search to enable faceted search, given an OWL ontology. The ontology describes semantic features of the APIs. We have designed the API classification ontology using LexOnt, a software we have built for semi-automatic ontology creation tool. LexOnt is geared toward non-experts within a service domain who want to create a high-level ontology that describes the domain. Using well- known NLP algorithms, LexOnt generates a list of top terms and phrases from the Programmable Web corpus to enable users to find high-level features that distinguish one Programmable Web service category from another. To also aid non-experts, LexOnt relies on outside sources such as Wikipedia and Wordnet to help the user identify the important terms within a service category. Using the ontology created from LexOnt, we have created APIBrowse, a faceted search interface for APIs. The ontology, in combination with the use of the Apache Solr search platform, is used to generate a faceted search interface for APIs based on their distinguishing features. With this ontology, an API is classified and displayed underneath multiple categories and displayed within the APIBrowse interface. APIBrowse gives programmers the ability to search for APIs based on their semantic features and keywords and presents them with a filtered and more accurate set of search results.
Knarig Arabshian is an Assistant Professor in the Computer Science Department at Hofstra University, since Fall 2014. Prior to that she was a Member of Technical Staff at Bell Labs in Murray Hill, NJ. She received her Ph.D. in Computer Science from Columbia University in 2008.
Professor Arabshian’s interests lie in the field of semantic web, service discovery and composition, context-aware computing and distributed systems. The goal of her research is to drive forward the idea of a personalized web. Her work explores ways of describing data meaningfully and designing frameworks and systems for efficient data discovery. During her tenure at Bell Labs, she worked on different aspects of ontology creation, distribution and querying.
Data Integration at the Ontology Engineering GroupOscar Corcho
Presentation done on the work being done on Data Integration at OEG-UPM (http://www.oeg-upm.net/), for the CredIBLE workshop, in Sophia-Antipolis (October 15th, 2012).
semantic data integration the process of using a conceptual representation of the data and of their relationships to eliminate possible heterogeneities.
This document summarizes a workshop on data integration using ontologies. It discusses how data integration is challenging due to differences in schemas, semantics, measurements, units and labels across data sources. It proposes that ontologies can help with data integration by providing definitions for schemas and entities referred to in the data. Core challenges discussed include dealing with multiple synonyms for entities and relationships between biological entities that depend on context. The document advocates for shared community ontologies that can be extended and integrated to facilitate flexible and responsive data integration across multiple sources.
This document provides an introduction to ontology from a lecture on the topic. It discusses the need for shared semantics and meaning mediation when integrating different information systems. Ontologies can provide formal specifications of conceptualizations to enable semantic integration and interoperability. Examples are given of how ontologies can be used for applications like open information systems, the semantic web, e-commerce, and more. Key points covered include what an ontology is, levels of ontological precision, and how ontologies differ from things like XML schemas, standard vocabularies, and conceptual data schemas in providing formalized meanings.
The document provides examples of ontology applications in agriculture domains including:
1. FAO examples such as a food safety ontology with 1600 concepts, a fisheries ontology integrating multiple systems with 25,000 concepts, and a food and agriculture journal ontology.
2. External examples including a crop biosecurity ontology cataloging training resources and a crop pest ontology to facilitate image searching.
3. Vivo, a virtual life sciences library at Cornell powered by an underlying ontology.
Introduction to Ontology Concepts and TerminologySteven Miller
The document introduces an ontology tutorial that will cover basic concepts of the Semantic Web, Linked Data, and the Resource Description Framework data model as well as the ontology languages RDFS and OWL. The tutorial is intended for information professionals who want to gain an introductory understanding of ontologies, ontology concepts, and terminology. The tutorial will explain how to model and structure data as RDF triples and create basic RDFS ontologies.
Ontologies in computer science and on the webFabien Gandon
The document discusses different types of ontological knowledge including formalized ontological knowledge, taxonomical knowledge as an example of ontological knowledge, and combining different kinds of ontological knowledge. Examples are provided of ontological primitives like classes, individuals, and hierarchical models.
This document provides an introduction to the Semantic Web, covering topics such as what the Semantic Web is, how semantic data is represented and stored, querying semantic data using SPARQL, and who is implementing Semantic Web technologies. The presentation includes definitions of key concepts, examples to illustrate technical aspects, and discussions of how the Semantic Web compares to other technologies. Major companies implementing aspects of the Semantic Web are highlighted.
Many applications required integration of data from different sources, such as data mining and data / information fusion, etc., and the problem facing any project like this is that data structure different way and the terms and their meanings different from each other, and in this paper we will discuss the most important problems and how solve it using ontology.
Ontology refers to theories of reality and existence. There are several categories of ontological theories: monism believes there is only one type of reality; dualism believes there are two (e.g. mind and body); pluralism believes reality is composed of many kinds of things. Descartes' dualism defined mind and body as completely distinct substances that interact mysteriously. Other theories like behaviorism, identity theory, and functionalism are monist attempts to explain mind and body as one substance. Pluralism argues reality is too complex to fit into just one or two categories.
The document introduces ontology and describes what it is from both philosophical and computer science perspectives. An ontology in computers consists of a vocabulary to describe a domain, specifications of the meaning of terms, and constraints capturing additional knowledge about the domain. It then provides an example ontology and discusses applications of ontologies such as for the semantic web. It also discusses important considerations for building ontologies such as collaboration, versioning, and ease of use.
(video of these slides available here http://fsharpforfunandprofit.com/fppatterns/)
In object-oriented development, we are all familiar with design patterns such as the Strategy pattern and Decorator pattern, and design principles such as SOLID.
The functional programming community has design patterns and principles as well.
This talk will provide an overview of some of these, and present some demonstrations of FP design in practice.
This document provides an introduction to organic chemistry. It discusses that organic chemistry is the study of carbon compounds and their structures and reactions. Over 16 million carbon compounds are known. Carbon can form stable chains and rings due to its strong single and double bonds. Functional groups are atoms or groups that are involved in characteristic chemical reactions. Hydrocarbons only contain carbon and hydrogen, and homologous series differ by CH2 units. Isomers have the same molecular formula but different structures. The document also discusses alkenes, alkynes and alkyl halides.
This document provides an introduction to organic chemistry, including:
- Definitions of organic and inorganic compounds
- Empirical, molecular, and structural formulas and how to determine them
- Functional groups and homologous series that classify organic molecules
- Primary, secondary, tertiary classifications of carbon atoms and related groups
- Types of isomerism including structural, stereoisomerism, and examples of each
This document provides an introduction to organic chemistry for A-level students. It begins with an overview of organic chemistry and the special properties of carbon that allow for the vast number of carbon compounds. It then discusses specific topics like functional groups, isomers, naming conventions (IUPAC), and more. The document is intended to help students understand key concepts in organic chemistry.
Classifying Chemicals with Description Graphs and Logic ProgrammingDespoina Magka
OWL 2 is widely used to describe complex objects such as chemical molecules; however, OWL 2 axioms cannot represent `structural' features of chemical entities such as having a ring. A combination of OWL 2, rules and \emph{description graphs} (DGs) has been suggested as a possible solution, but an attempt to apply this formalism in a chemical Semantic Web application has revealed several drawbacks. Based on this experience, we present a radically different approach to modelling complex objects via a novel formalism that we call Description Graph Logic Programs. At the syntactic level, our approach combines DGs, rules, and OWL 2 RL axioms, but we give semantics to our formalism via a translation into logic programs interpreted under stable model semantics. The result is an expressive formalism that is well suited for modelling objects with complex structure, that captures the OWL 2 RL profile, and that thus fits naturally into the Semantic Web landscape. Additionally, we test the practical feasibility of our approach by means of a prototypical implementation which provides encouraging results.
Acyclicity Conditions and their Application to Query Answering in Description...Despoina Magka
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a key problem in knowledge representation and databases. This problem can be solved using the chase (aka materialisation) algorithm; however, CQ answering is undecidable for general existential rules, so the chase is not guaranteed to terminate. Several acyclicity conditions provide sufficient conditions for chase termination. In this paper, we present two novel such conditions—modelfaithful acyclicity (MFA) and model-summarising acyclicity (MSA)—that generalise many of the acyclicity conditions known so far in the literature. Materialisation provides the basis for several widely-used OWL 2 DL reasoners. In order to avoid termination problems, many of these systems handle only the OWL 2 RL profile of OWL 2 DL; furthermore, some systems go beyond OWL 2 RL, but they provide no termination guarantees. In this paper we investigate whether various acyclicity conditions can provide a principled and practical solution to these problems. On the theoretical side, we show that query answering for acyclic ontologies is of lower complexity than for general ontologies. On the practical side, we show that many of the commonly used OWL 2 DL ontologies are MSA, and that the facts obtained via materialisation are not too large. Thus, our results suggest that principled extensions to materialisationbased OWL 2 DL reasoners may be practically feasible.
Tractable Extensions of the Description Logic EL with Numerical DatatypesDespoina Magka
We consider extensions of the lightweight description logic (DL) EL with numerical datatypes such as naturals, integers, rationals and reals equipped with relations such as equality and inequalities. It is well-known that the main reasoning problems for such DLs are decid- able in polynomial time provided that the datatypes enjoy the so-called convexity property. Unfortunately many combinations of the numerical relations violate convexity, which makes the usage of these datatypes rather limited in practice. In this paper, we make a more fine-grained complexity analysis of these DLs by considering restrictions not only on the kinds of relations that can be used in ontologies but also on their occurrences, such as allowing certain relations to appear only on the left- hand side of the axioms. To this end, we introduce a notion of safety for a numerical datatype with restrictions (NDR) which guarantees tractabil- ity, extend the EL reasoning algorithm to these cases, and provide a complete classification of safe NDRs for natural numbers, integers, ra- tionals and reals.
Computing Stable Models for Nonmonotonic Existential RulesDespoina Magka
We consider function-free existential
rules extended with nonmonotonic negation under
a stable model semantics. We present new acyclicity and stratification conditions that identify a large
class of rule sets having finite, unique stable models, and we show how the addition of constraints on
the input facts can further extend this class. Checking these conditions is computationally feasible,
and we provide tight complexity bounds. Finally,
we demonstrate how these new methods allowed
us to solve relevant reasoning problems over a real-world knowledge base from biochemistry using an
off-the-shelf answer set programming engine.
This thesis examines the use of nonmonotonic existential rules for knowledge representation of structured entities. Chapter 1 introduces logical formalisms for knowledge representation such as description logics and rule-based systems. It outlines key features needed for an ontology language and previews the thesis structure. Chapter 2 defines the syntax and stable model semantics of nonmonotonic existential rules. It discusses reasoning tasks and computational complexity. The thesis goes on to analyze the use of existential rules for modeling structured objects, define acyclicity conditions for ensuring finite stable models, introduce stratication conditions for ensuring unique stable models, and extend these results to rules with constraints. It presents an ontology for chemistry in existential rules and evaluates an implementation on classifying
This work introduces faceted service discovery. It uses the Programmable Web directory as its corpus of APIs and enhances the search to enable faceted search, given an OWL ontology. The ontology describes semantic features of the APIs. We have designed the API classification ontology using LexOnt, a software we have built for semi-automatic ontology creation tool. LexOnt is geared toward non-experts within a service domain who want to create a high-level ontology that describes the domain. Using well- known NLP algorithms, LexOnt generates a list of top terms and phrases from the Programmable Web corpus to enable users to find high-level features that distinguish one Programmable Web service category from another. To also aid non-experts, LexOnt relies on outside sources such as Wikipedia and Wordnet to help the user identify the important terms within a service category. Using the ontology created from LexOnt, we have created APIBrowse, a faceted search interface for APIs. The ontology, in combination with the use of the Apache Solr search platform, is used to generate a faceted search interface for APIs based on their distinguishing features. With this ontology, an API is classified and displayed underneath multiple categories and displayed within the APIBrowse interface. APIBrowse gives programmers the ability to search for APIs based on their semantic features and keywords and presents them with a filtered and more accurate set of search results.
Knarig Arabshian is an Assistant Professor in the Computer Science Department at Hofstra University, since Fall 2014. Prior to that she was a Member of Technical Staff at Bell Labs in Murray Hill, NJ. She received her Ph.D. in Computer Science from Columbia University in 2008.
Professor Arabshian’s interests lie in the field of semantic web, service discovery and composition, context-aware computing and distributed systems. The goal of her research is to drive forward the idea of a personalized web. Her work explores ways of describing data meaningfully and designing frameworks and systems for efficient data discovery. During her tenure at Bell Labs, she worked on different aspects of ontology creation, distribution and querying.
Data Integration at the Ontology Engineering GroupOscar Corcho
Presentation done on the work being done on Data Integration at OEG-UPM (http://www.oeg-upm.net/), for the CredIBLE workshop, in Sophia-Antipolis (October 15th, 2012).
semantic data integration the process of using a conceptual representation of the data and of their relationships to eliminate possible heterogeneities.
This document summarizes a workshop on data integration using ontologies. It discusses how data integration is challenging due to differences in schemas, semantics, measurements, units and labels across data sources. It proposes that ontologies can help with data integration by providing definitions for schemas and entities referred to in the data. Core challenges discussed include dealing with multiple synonyms for entities and relationships between biological entities that depend on context. The document advocates for shared community ontologies that can be extended and integrated to facilitate flexible and responsive data integration across multiple sources.
This document provides an introduction to ontology from a lecture on the topic. It discusses the need for shared semantics and meaning mediation when integrating different information systems. Ontologies can provide formal specifications of conceptualizations to enable semantic integration and interoperability. Examples are given of how ontologies can be used for applications like open information systems, the semantic web, e-commerce, and more. Key points covered include what an ontology is, levels of ontological precision, and how ontologies differ from things like XML schemas, standard vocabularies, and conceptual data schemas in providing formalized meanings.
The document provides examples of ontology applications in agriculture domains including:
1. FAO examples such as a food safety ontology with 1600 concepts, a fisheries ontology integrating multiple systems with 25,000 concepts, and a food and agriculture journal ontology.
2. External examples including a crop biosecurity ontology cataloging training resources and a crop pest ontology to facilitate image searching.
3. Vivo, a virtual life sciences library at Cornell powered by an underlying ontology.
Introduction to Ontology Concepts and TerminologySteven Miller
The document introduces an ontology tutorial that will cover basic concepts of the Semantic Web, Linked Data, and the Resource Description Framework data model as well as the ontology languages RDFS and OWL. The tutorial is intended for information professionals who want to gain an introductory understanding of ontologies, ontology concepts, and terminology. The tutorial will explain how to model and structure data as RDF triples and create basic RDFS ontologies.
Ontologies in computer science and on the webFabien Gandon
The document discusses different types of ontological knowledge including formalized ontological knowledge, taxonomical knowledge as an example of ontological knowledge, and combining different kinds of ontological knowledge. Examples are provided of ontological primitives like classes, individuals, and hierarchical models.
This document provides an introduction to the Semantic Web, covering topics such as what the Semantic Web is, how semantic data is represented and stored, querying semantic data using SPARQL, and who is implementing Semantic Web technologies. The presentation includes definitions of key concepts, examples to illustrate technical aspects, and discussions of how the Semantic Web compares to other technologies. Major companies implementing aspects of the Semantic Web are highlighted.
Many applications required integration of data from different sources, such as data mining and data / information fusion, etc., and the problem facing any project like this is that data structure different way and the terms and their meanings different from each other, and in this paper we will discuss the most important problems and how solve it using ontology.
Ontology refers to theories of reality and existence. There are several categories of ontological theories: monism believes there is only one type of reality; dualism believes there are two (e.g. mind and body); pluralism believes reality is composed of many kinds of things. Descartes' dualism defined mind and body as completely distinct substances that interact mysteriously. Other theories like behaviorism, identity theory, and functionalism are monist attempts to explain mind and body as one substance. Pluralism argues reality is too complex to fit into just one or two categories.
The document introduces ontology and describes what it is from both philosophical and computer science perspectives. An ontology in computers consists of a vocabulary to describe a domain, specifications of the meaning of terms, and constraints capturing additional knowledge about the domain. It then provides an example ontology and discusses applications of ontologies such as for the semantic web. It also discusses important considerations for building ontologies such as collaboration, versioning, and ease of use.
(video of these slides available here http://fsharpforfunandprofit.com/fppatterns/)
In object-oriented development, we are all familiar with design patterns such as the Strategy pattern and Decorator pattern, and design principles such as SOLID.
The functional programming community has design patterns and principles as well.
This talk will provide an overview of some of these, and present some demonstrations of FP design in practice.
This document provides an introduction to organic chemistry. It discusses that organic chemistry is the study of carbon compounds and their structures and reactions. Over 16 million carbon compounds are known. Carbon can form stable chains and rings due to its strong single and double bonds. Functional groups are atoms or groups that are involved in characteristic chemical reactions. Hydrocarbons only contain carbon and hydrogen, and homologous series differ by CH2 units. Isomers have the same molecular formula but different structures. The document also discusses alkenes, alkynes and alkyl halides.
This document provides an introduction to organic chemistry, including:
- Definitions of organic and inorganic compounds
- Empirical, molecular, and structural formulas and how to determine them
- Functional groups and homologous series that classify organic molecules
- Primary, secondary, tertiary classifications of carbon atoms and related groups
- Types of isomerism including structural, stereoisomerism, and examples of each
This document provides an introduction to organic chemistry for A-level students. It begins with an overview of organic chemistry and the special properties of carbon that allow for the vast number of carbon compounds. It then discusses specific topics like functional groups, isomers, naming conventions (IUPAC), and more. The document is intended to help students understand key concepts in organic chemistry.
Organic chemistry is the study of carbon compounds. Carbon forms strong covalent bonds and can form long chains and rings, resulting in a vast number of possible structures. Organic molecules are classified based on their functional groups, such as alkanes (no functional group), alkenes (C=C double bond), and haloalkanes (halogen atom attached to carbon). Isomers are compounds with the same molecular formula but different structures, including positional isomers (functional group in a different position), chain isomers (different carbon skeleton arrangement), and functional isomers (different functional groups). Nomenclature involves naming compounds based on the parent chain, functional groups, and location of any branches.
This document discusses stereochemistry, which is the study of the three-dimensional arrangement of atoms in molecules. Subtle differences in spatial arrangements can lead to significant effects. Chirality refers to "handedness", where a chiral molecule has a non-superimposable mirror image called an enantiomer. Chiral carbon atoms have four different groups bonded and can exist as two enantiomers. The R/S system is used to distinguish between enantiomers using the Cahn-Ingold-Prelog priority rules. Enantiomers have identical properties except for their ability to rotate plane polarized light in opposite directions.
1) The document provides revision materials for organic chemistry concepts like nomenclature, functional groups, and molecular structure and stability for students who feel lost or confused.
2) It explains IUPAC naming rules and gives examples of naming simple organic compounds. Common names are also mentioned.
3) Bond polarity is discussed, noting that most carbon-heteroatom bonds are polarized due to the higher electronegativity of heteroatoms like oxygen, nitrogen, and halogens. Bond dipoles are illustrated for several examples.
Organic chemistry is the study of carbon-containing compounds. It was originally thought that compounds found in living things were fundamentally different than non-living compounds, but we now know this is not true. Organic structures can be represented using condensed or skeletal structures, assuming carbons and hydrogens are present. Common organic reactions include substitution, elimination, and addition reactions. Substitution reactions involve replacing one group with another. The SN2 substitution reaction proceeds in one step with simultaneous attack of the nucleophile and departure of the leaving group. This results in inversion of configuration at any chiral centers.
Stereochemistry is the study of the three-dimensional structure of molecules. Stereoisomers differ in their spatial arrangement but have the same connectivity and functional groups. The two main classes of isomers are constitutional isomers and stereoisomers. Stereochemistry plays an important role in determining the properties and reactions of organic compounds. Many drugs exhibit different biological effects based on their stereochemistry. Enzymes can also distinguish between stereoisomers.
The document discusses covalent bonding. Covalent bonding occurs when atoms share electron pairs to achieve stable electron configurations, rather than gaining or losing electrons like in ionic bonding. Chlorine (Cl2) forms a single covalent bond by each chlorine atom sharing one electron pair. Oxygen (O2) forms a double covalent bond, with each atom sharing two electron pairs to fill its octet. Covalent bonding allows for a diverse array of compounds from small molecules like water to large complex molecules like proteins.
This document discusses stereochemistry and the three-dimensional arrangements of atoms in space. It introduces key concepts such as stereoisomers, chirality, cis-trans isomers, and the E-Z notation system for naming alkene stereoisomers. Examples are provided to illustrate these concepts, including discussions of triglycerides, fatty acids, and the Cahn-Ingold-Prelog system for ranking substituents.
This document discusses covalent bonding and molecular structures. It defines covalent bonds as bonds formed by the sharing of electron pairs between atoms. It explains that molecules are groups of atoms held together by covalent bonds, and that their structures can be represented through chemical formulas, structural diagrams, and Lewis dot diagrams. It provides examples of how to determine the elements and numbers of each from a chemical formula, and how to draw Lewis dot diagrams of molecules by matching atoms to reach full valence shells.
This document discusses covalent bonding and molecular structures. It defines covalent bonds as bonds formed by shared electron pairs between atoms. It explains that molecules are groups of atoms held together by covalent bonds in a specific ratio and shape. The document discusses drawing Lewis dot structures and molecular diagrams to represent molecules and the bonding between their atoms. It provides examples of drawing the Lewis dot structure for carbon tetrachloride and matching molecular diagrams to chemical formulas.
Constitutional isomers have the same molecular formula but different connectivity of atoms. Stereoisomers have the same molecular formula and connectivity but different spatial arrangements. There are two types of stereoisomers: enantiomers, which are nonsuperposable mirror images, and diastereomers, which are not mirror images. Chiral molecules are nonsuperposable on their mirror images and exist as enantiomer pairs. The R/S system assigns configurations based on atomic number priorities around stereocenters. Enantiomers have identical physical properties but opposite specific rotations. A racemic mixture contains equal amounts of both enantiomers and has no net rotation.
The document discusses organic chemistry, including why the field is important for understanding biological processes and medicine. It covers topics like the structure and bonding of carbon compounds, isomerism, functional groups, and reactions of alkanes. The presentation provides an overview of the key concepts and components of organic chemistry.
(i) Non-classical carbocations display delocalization of sigma bonds through 3-center-2-electron bonds in bridged systems. Neighboring group participation can assist reactions by donating electrons through lone pairs, pi bonds, aromatic rings, or sigma bonds.
(ii) The pinacol-pinacolone rearrangement involves the migration of an alkyl group from one carbon to another after the loss of a leaving group from a vicinal diol. The migration is assisted by delocalization of the carbocation intermediate onto the oxygen atom.
(iii) In asymmetrical glycols, the group with greater ability for carbocation delocalization, such as phenyl, will migrate preferentially over
This document provides an overview of unsaturated hydrocarbons, specifically focusing on alkenes. It discusses the characteristics, nomenclature, structural formulas, isomerism, naturally occurring forms, physical properties and chemical reactions of alkenes. Key topics covered include the IUPAC naming rules for alkenes and cycloalkenes, the different types of isomerism that can occur in alkenes, common naturally occurring alkenes like pheromones and terpenes, and common chemical reactions like addition reactions, hydrogenation, and halogenation.
This document provides an overview of unsaturated hydrocarbons, specifically alkenes. It discusses the characteristics, nomenclature, structural formulas, isomerism, naturally occurring forms, and chemical reactions of alkenes. Key topics covered include the IUPAC naming rules for alkenes and cycloalkenes, the different types of isomerism found in alkenes including constitutional and cis-trans isomerism, common naturally occurring alkenes like pheromones and terpenes, and important chemical reactions of alkenes such as addition reactions like hydrogenation, halogenation, hydrohalogenation, and hydration.
This document provides an overview of isomerism in organic chemistry. It discusses four main types of isomerism: structural isomerism, stereoisomerism, geometrical isomerism, and optical isomerism. Structural isomerism occurs when compounds have the same molecular formula but different structural formulas. Stereoisomerism occurs when compounds have the same connectivity of atoms but different arrangements in space. Geometrical isomerism is specific to alkenes and results from restricted rotation around double bonds. Optical isomerism produces non-superimposable mirror images known as enantiomers and results from chiral centers.
Organic chemistry is a chemistry subdiscipline involving the scientific study of the structure, properties, and reactions of organic compounds and organic materials, i.e., matter in its various forms that contain carbon atoms.
Here are the key definitions you need to know regarding isomerism:
- Structural isomers are compounds with the same molecular formula but different connectivity of atoms. They have different structural formulas.
- Stereoisomers are compounds with the same connectivity of atoms (structural formula) but with a different spatial arrangement. The chemical and physical properties are very similar.
- E/Z isomerism refers specifically to stereoisomers around a double bond. The groups on each side of the double bond are either on the same side (cis isomer) or opposite sides (trans isomer).
- Enantiomers are non-superimposable mirror images and an example of stereoisomers. They have identical
Similar to Ontology-Based Classification of Molecules: a Logic Programming Approach (20)
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Ontology-Based Classification of Molecules: a Logic Programming Approach
1. O NTOLOGY-BASED
C LASSIFICATION OF M OLECULES :
A L OGIC P ROGRAMMING A PPROACH
Despoina Magka
Department of Computer Science, University of Oxford
November 30, 2012
3. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
1
4. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
1
5. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
1
6. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
Fast, automatic and repeatable classification driven by
Semantic technologies
1
7. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
Fast, automatic and repeatable classification driven by
Semantic technologies
Web Ontology Language, a W3C standard family
of logic-based formalisms
1
8. B IOINFORMATICS AND S EMANTIC T ECHNOLOGIES
Life sciences data deluge
Hierarchical organisation of biochemical knowledge
Fast, automatic and repeatable classification driven by
Semantic technologies
Web Ontology Language, a W3C standard family
of logic-based formalisms
OWL bio- and chemo-ontologies widely adopted
1
9. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
2
10. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
2
11. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
caffeine is a cyclic molecule
2
12. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
serotonin is an organic molecule
2
13. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
ascorbic acid is a carboxylic ester
2
14. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
Pharmaceutical design and study of biological pathways
2
15. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
Pharmaceutical design and study of biological pathways
ChEBI is manually incremented
2
16. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
Pharmaceutical design and study of biological pathways
ChEBI is manually incremented
Currently ~30,000 chemical entities, expands at 3,500/yr
2
17. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
Pharmaceutical design and study of biological pathways
ChEBI is manually incremented
Currently ~30,000 chemical entities, expands at 3,500/yr
Existing chemical databases describe millions of molecules
2
18. T HE C H EBI O NTOLOGY
OWL ontology Chemical Entities of Biological Interest
Dictionary of molecules with taxonomical information
Pharmaceutical design and study of biological pathways
ChEBI is manually incremented
Currently ~30,000 chemical entities, expands at 3,500/yr
Existing chemical databases describe millions of molecules
Speed up growth by automating chemical classification
2
19. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
3
20. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
E XAMPLE
C C
C C
3
21. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
C C
C C
3
22. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
C C
C C
3
23. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
C C
C C
OWL-based reasoning support
1 Is cyclobutane a cyclic molecule?
3
24. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
C C
C C
OWL-based reasoning support
1 Is cyclobutane a cyclic molecule?
3
25. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
Oxygen
C C
C C
OWL-based reasoning support
1 Is cyclobutane a cyclic molecule?
3
26. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
Oxygen
C C
C C
OWL-based reasoning support
1 Is cyclobutane a cyclic molecule?
2 Is cyclobutane a hydrocarbon?
3
27. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
Oxygen
C C
C C
3
28. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
Oxygen
C C
C C
Required reasoning support
1 Is cyclobutane a cyclic molecule?
2 Is cyclobutane a hydrocarbon?
3
29. E XPRESSIVITY L IMITATIONS OF OWL
1 At least one tree-shaped model for each consistent OWL
ontology problematic representation of cycles
2 No minimality condition on the models hard to axiomatise
classes based on the absence of attributes
E XAMPLE
Cyclobutane ∃(= 4)hasAtom.(Carbon ∃(= 2)hasBond.Carbon)
Oxygen
C C
C C
Required reasoning support
1 Is cyclobutane a cyclic molecule?
2 Is cyclobutane a hydrocarbon?
3
30. R ESULTS OVERVIEW
1 Expressive and decidable formalism for modelling complex
objects: Description Graphs Logic Programs
4
31. R ESULTS OVERVIEW
1 Expressive and decidable formalism for modelling complex
objects: Description Graphs Logic Programs
2 Modelling that spans a wide range of structure-dependent
classes of molecules
4
32. R ESULTS OVERVIEW
1 Expressive and decidable formalism for modelling complex
objects: Description Graphs Logic Programs
2 Modelling that spans a wide range of structure-dependent
classes of molecules
3 Implementation that draws upon DLV and performs
structure-based classification with a significant speedup
4
33. R ESULTS OVERVIEW
1 Expressive and decidable formalism for modelling complex
objects: Description Graphs Logic Programs
2 Modelling that spans a wide range of structure-dependent
classes of molecules
3 Implementation that draws upon DLV and performs
structure-based classification with a significant speedup
4 Evaluation over part of the manually curated ChEBI
ontology revealed modelling errors
4
34. R ESULTS OVERVIEW
1 Expressive and decidable formalism for modelling complex
objects: Description Graphs Logic Programs
2 Modelling that spans a wide range of structure-dependent
classes of molecules
3 Implementation that draws upon DLV and performs
structure-based classification with a significant speedup
4 Evaluation over part of the manually curated ChEBI
ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
4
36. C LASSIFYING S TRUCTURED O BJECTS
ascorbicAcid : 0
o
6
o c o
o
5 c 11 c 1 c
hasAtom h
2
12 10 7
single c c
13
double 9 8
4 o 3 o
5
37. C LASSIFYING S TRUCTURED O BJECTS
ascorbicAcid : 0
o
6
o c o
o
5 c 11 c 1 c
hasAtom h
2
12 10 7
single c c
13
double 9 8
4 o 3 o
ascorbicAcid(x) →hasAtom(x, f1 (x)) ∧ . . . ∧ hasAtom(x, f13 (x))
o(f1 (x)) ∧ . . . ∧ c(f7 (x)) ∧ . . . ∧
single(f1 (x), f7 (x)) ∧ double(f7 (x), f2 (x)) ∧ . . .
5
38. C LASSIFYING S TRUCTURED O BJECTS
ascorbicAcid : 0
o
6
o c o
o
5 c 11 c 1 c
hasAtom h
2
12 10 7
single c c
13
double 9 8
4 o 3 o
ascorbicAcid(x) →hasAtom(x, f1 (x)) ∧ . . . ∧ hasAtom(x, f13 (x))
o(f1 (x)) ∧ . . . ∧ c(f7 (x)) ∧ . . . ∧
single(f1 (x), f7 (x)) ∧ double(f7 (x), f2 (x)) ∧ . . .
hasAtom(x, y1 ) ∧ hasAtom(x, y2 ) ∧ y1 = y2 → polyatomicEntity(x)
∧5 hasAtom(x, yi ) ∧ c(y1 ) ∧ o(y2 ) ∧ o(y3 )∧
i=1
c(y4 ) ∧ horc(y5 ) ∧ double(y1 , y2 )∧
single(y1 , y3 ) ∧ single(y3 , y4 ) ∧ single(y1 , y5 ) → carboxylicEster(x)
5
39. C LASSIFYING S TRUCTURED O BJECTS
ascorbicAcid : 0
o
6
o c o
o
5 c 11 c 1 c
hasAtom h
2
12 10 7
single c c
13
double 9 8
4 o 3 o
Input fact: ascorbicAcid(a)
Stable model: ascorbicAcid(a), hasAtom(a, af ) for 1 ≤ i ≤ 13,
i
o(af ) for 1 ≤ i ≤ 6, c(af ) for 7 ≤ i ≤ 12, h(af ), single(af , af ),
i i 13 8 3
single(af , af ), single(af , af ) for i ∈ {5, 11}, single(af , af ),
9 4 12 i 11 6
single(af , af ) for i ∈ {1, 9, 11, 13}, single(af , af ) for i ∈ {1, 8},
10 i 7 i
double(af , af ), double(af , af ), horc(af ) for 7 ≤ i ≤ 13,
2 7 8 9 i
polyatomicEntity(a), carboxylicEster(a), cyclic(a)
5
40. C LASSIFYING S TRUCTURED O BJECTS
ascorbicAcid : 0
o
6
o c o
o
5 c 11 c 1 c
hasAtom h
2
12 10 7
single c c
13
double 9 8
4 o 3 o
Input fact: ascorbicAcid(a)
Stable model: ascorbicAcid(a), hasAtom(a, af ) for 1 ≤ i ≤ 13,
i
o(af ) for 1 ≤ i ≤ 6, c(af ) for 7 ≤ i ≤ 12, h(af ), single(af , af ),
i i 13 8 3
single(af , af ), single(af , af ) for i ∈ {5, 11}, single(af , af ),
9 4 12 i 11 6
single(af , af ) for i ∈ {1, 9, 11, 13}, single(af , af ) for i ∈ {1, 8},
10 i 7 i
double(af , af ), double(af , af ), horc(af ) for 7 ≤ i ≤ 13,
2 7 8 9 i
polyatomicEntity(a), carboxylicEster(a), cyclic(a)
Ascorbic acid is a cyclic polyatomic entity and a carboxylic ester
5
41. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
6
42. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
6
43. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
6
44. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
6
45. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
6
46. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
6
47. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
6
48. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
6
49. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
6
50. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
6
51. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
Saturated molecules
6
52. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
Saturated molecules
4 Cyclicity-related classes
6
53. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
Saturated molecules
4 Cyclicity-related classes
Benzenes
6
54. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
Saturated molecules
4 Cyclicity-related classes
Benzenes
Cyclic molecules
6
55. C HEMICAL C LASSES W E C OVERED
1 Existence of subcomponents
Carbon molecules
Carboxylic acids and carboxylic esters
Ketones and aldehydes
2 Exact cardinality of parts
Exactly two carbons
Dicarboxylic acid
3 Exclusive composition
Inorganic molecules
Hydrocarbons
Saturated molecules
4 Cyclicity-related classes
Benzenes
Cyclic molecules
Alkanes
6
56. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
7
57. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
7
58. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
7
59. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
7
60. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
[Hastings et al., 2010] 140 molecules in 4 hours
[Magka et al., 2012] 70 molecules in 450 secs
7
61. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
[Hastings et al., 2010] 140 molecules in 4 hours
[Magka et al., 2012] 70 molecules in 450 secs
Subsumptions exposed by our prototype:
7
62. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
[Hastings et al., 2010] 140 molecules in 4 hours
[Magka et al., 2012] 70 molecules in 450 secs
Subsumptions exposed by our prototype:
ascorbic acid is a polyatomic entity, a carboxylic ester and a
cyclic molecule
missing from the ChEBI OWL ontology
7
63. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
[Hastings et al., 2010] 140 molecules in 4 hours
[Magka et al., 2012] 70 molecules in 450 secs
Subsumptions exposed by our prototype:
ascorbic acid is a polyatomic entity, a carboxylic ester and a
cyclic molecule
missing from the ChEBI OWL ontology
Contradictory subclass relation from ChEBI:
7
64. E MPIRICAL E VALUATION
Draws upon DLV, a deductive databases engine
Evaluation with data extracted from ChEBI
500 molecules under 51 chemical classes in 40 secs
Quicker than other approaches:
[Hastings et al., 2010] 140 molecules in 4 hours
[Magka et al., 2012] 70 molecules in 450 secs
Subsumptions exposed by our prototype:
ascorbic acid is a polyatomic entity, a carboxylic ester and a
cyclic molecule
missing from the ChEBI OWL ontology
Contradictory subclass relation from ChEBI:
Ascorbic acid is asserted to be a carboxylic acid (release 95)
Not listed among the subsumptions derived by our prototype
7
65. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
8
66. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
8
67. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
8
68. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
8
69. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
8
70. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
8
71. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
∧5 hasAtom(x, yi ) ∧ c(y1 ) ∧ o(y2 ) ∧ o(y3 ) ∧ c(y4 )∧
i=1
double(y1 , y2 ) ∧ single(y1 , y3 ) ∧ single(y3 , y4 ) ∧ single(y1 , y5 )
→ carboxylicEster(x)
8
72. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
define carboxylicEster
some hasAtom SMILES(COC(= O)[∗])
end.
8
73. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
8
74. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
E.g., Carboxylic ester is an organic molecular entity
8
75. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
8
76. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
E.g., Small molecules if they weigh less than 800 daltons
8
77. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
Classification of complex biological objects
8
78. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
Classification of complex biological objects
Integration with Protégé, Bioclipse, JChemPaint,. . .
8
79. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
Classification of complex biological objects
Integration with Protégé, Bioclipse, JChemPaint,. . .
Mapping from our logic to RDF
8
80. C ONCLUSION AND F URTHER R ESEARCH
Results
1 Expressive and decidable formalism for complex objects
2 Wide range of structure-based classes
3 DLV-based implementation exhibits a significant speedup
4 Evaluation over ChEBI ontology revealed modelling errors
Language for representing biochemical structures with a
favourable performance/expressivity trade-off
Future directions
SMILES-based surface syntax
Detect subsumptions between classes
Extensions with numerical datatypes
Classification of complex biological objects
Integration with Protégé, Bioclipse, JChemPaint,. . .
Mapping from our logic to RDF
Thank you! Questions?!?
8