Ontology Web Language

Ontology-based disease classification offers a way to rigorously assign disease types and to reuse diagnostic knowledge. However, ontology itself is not sufficient for fully representing the complex knowledge needed in classification schemes which are continuously evolving. This article describes the application of SWRL/OWL-DL to the representation of knowledge intended for proper classification of a complex neurological condition, namely epilepsy. The authors present a rigorous and expandable approach to the ontological classification of epileptic seizures based on the 1981ILAE classification. It provides a classification knowledge base that can be extended with rules that describe constraints in SWRL. Moreover, by transforming an OWL classification scheme into JESS (rule engine in Java platform) facts and by transforming SWRL constraints into JESS, logical inferences and reasoning provide a mechanism to discover new knowledge and facts. The logic representation of epileptic classi...

The ever increasing amount of data gathered by more growers in more years offers possibilities to add value. Therefore—for interested parties and stakeholders—a common and controlled vocabulary of the potato domain that describes concepts, attributes, and the relations between them in a formal way using a standardised knowledge representation language is being developed: a potato ontology. The advantage is that all possible stakeholders will be able to understand the data expressed by this ontology and that software applications can process them automatically. It will also allow the application of advanced numerical techniques that may help to uncover previously unknown correlations. This version of the potato ontology aims at the domain of processing potatoes in a setting of mechanised potato production where growers have access to automated decision support systems and exchange data electronically. This paper describes the procedures to establish such an ontology where competency questions formulated by stakeholders and potential users take a central position. The potato ontology formally describes “Concepts” or “Classes”. The three main classes are those used in crop ecology: Crop, Environment and Management. Classes, e.g., biocides are a subclass of agro-chemicals, and in turn have a subclass Fungicides. The ontology also describes the “Properties” of classes, e.g., agrochemicals are produced synthetically in a factory; biocides are used to protect crops and fungicides to control fungi. The ontology also describes the “Attributes” (properties) of the concepts, e.g., all agrochemicals have attributes such as dose and time of application and mode of application. “Restrictions” may be that a particular chemical can only be applied with a certain type of equipment, or its application is restricted to a certain period or dose. The ontology also features “Instances” which are the individual data such as a particular herbicide treatment with values for field, time, dose, active ingredient, trademark, mode of application, which equipment operated by whom. The standardisation language used is the “Ontology Web Language”.

NT Nguyen et al. (Eds.): KES-AMSTA 2007, LNAI 4496, pp. 328–337, 2007. © Springer-Verlag Berlin Heidelberg 2007 ... Ontology Agent Based Rule Base Fuzzy Cognitive Maps ... Alejandro Peña1,2,3, Humberto Sossa3, and Francisco Gutierrez3 ... WOLNM 1, UPIICSA 2 & CIC ...

The Ontology Web Language (OWL) is a language used for the Semantic Web. OWL is based on Description Logics (DLs), a family of logical formalisms for representing and reasoning about conceptual and terminological knowledge. Among these, the logic \(\mathcal{ALC\,}\) is a ground DL used in many practical cases. Moreover, the Semantic Web appears as a new field for the application of formal methods, that could be used to increase its reliability. A starting point could be the formal verification of satisfiability provers for DLs. In this paper, we present the PVS specification of a prover for \(\mathcal{ALC\,}\) , as well as the proofs of its termination, soundness and completeness. We also present the formalization of the well–foundedness of the multiset relation induced by a well–founded relation. This result has been used to prove the termination and the completeness of the \(\mathcal{ALC\,}\) prover.

The recent growth of using agents in representing web services is causing difficulties in finding specific types of services. This problem usually arises because matchmaking techniques for services are often based on string comparison and service providers might neglect to provide enough or appropriate keywords for the matchmaking process. In this paper we report on an approach that makes use of formal ontologies and automated reasoning services in order to improve the matchmaking process. Our approach is based on the Ontology Web Language (OWL), the OWL reasoner RACER, and the agent framework DECAF. Our use of OWL ontologies is two- fold. First, we use ontologies in order to express the particular knowledge of agents. These ontologies are grounded by referring to a so-called common upper ontology providing the necessary glue between the different agent domains. Second, with the help of OWL-S, a standard OWL ontology designed for specifying service descriptions, agents describe form...

Concept extraction can help in building ontologies, which are the main component of the semantic Web. Ontologies are not only used in the semantic Web, but also in other fields such as Information Retrieval to improve the retrieval. In this work, an Automatic Concept Extractor, which processes Arabic text, is presented. The algorithm of the Automatic Concept Extractor tags the words in the text, finds the pattern of each noun, and outputs only those nouns whose patterns match one of the concepts patterns in the concepts extraction rules. The result of each rule was evaluated individually to find the rules with the highest precision. Two datasets were crawled from the Web and converted to XML. Each rule was tested twice with each dataset as the input. The average precision of the rules showed that the rules with the patterns "Tafe'el" “ليعفت” and Fe'aleh “ةلاعف” achieved a high precision.