The aim of semantic science is to allow for the publications of ontologies, observation data, and hypotheses/theories. Hypotheses make predictions on data and on new cases. Those hypotheses that fit the available evidence are called theories. This paper considers how thoeries can be used for predictions in new cases. Theories are typically very narrow and not all of the inputs to a theory are observed, so to make predictions on a particular case, many theories need to be used. Without any global design, the available theories do not necessarily fit together nicely. This paper explains how theories can be combined into theory ensembles to make predictions on a particular case. This is needed to evaluate theories, and to make useful predictions. We motivate and give desiderata for theory ensembles for level 1, feature-based, semantic science, which assumes that the data and the theories can be described in terms of features (random variables).

Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reasoning services in this context. Query emptiness asks whether a given query has an empty answer over all data sets formulated in a given signature. Predicate emptiness is defined analogously, but quantifies universally over all queries that contain a given predicate. In this paper, we determine the computational complexity of query emptiness and predicate emptiness in the EL, DL-Lite, and ALC-families of description logics, investigate the connection to ontology modules, and perform a practical case study to evaluate the new reasoning services.

Invited Talk by Ian Horrocks Ontologies and ontology based systems are rapidly becoming mainstream technologies, with RDF and OWL now being deployed in diverse application domains, and with major technology vendors starting to augment their existing systems with ontological reasoning. For example, Oracle Inc. recently enhanced its well-known database management system with modules that use RDF/OWL ontologies to support "semantic data management," and their product brochure lists numerous application areas that can benefit from this technology, including enterprise information integration, knowledge mining, finance, compliance management and life science research. While gratifying to the KR research community, this success also brings with it many challenges. In particular, ontology reasoning systems will need to exhibit robust scalability if deployments in large scale applications are to be successful.

Reasoning with dates and duration has long been addressed by the community. Existing duration ontologies, however, lack complete axiomatizations of their intended models; many simply represent timedurations as real numbers and treat the duration function as a metric on the timeline. We show that such approaches are inadequate and provide a first-order ontology of duration that overcomes these limitations.

We mark up a corpus of LaTeX lecture notes semantically and expose them as Linked Data in XHTML+MathML+RDFa. Our application makes the resulting documents interactively browsable for students. Our ontology helps to answer queries from students and lecturers, and paves the path towards an integration of our corpus with external sites.

This paper discusses the knowledge integration of clinical information extracted from distributed medical ontology in order to ameliorate a machine learning-based multi-label coding assignment system. The proposed approach is implemented using a decision tree based cascade hierarchical technique on the university hospital data for patients with Coronary Heart Disease (CHD). The preliminary results obtained show a satisfactory finding.

Painters write about their what artists say about their own work, using motivations; photographers, about details of the concept mapping as a conceptual capture tool (Eskridge et.

A frequent topic discussed in the Linked Data community, especially when trying to outreach its values, is "What can we do with all this data ?". In this paper, we demonstrate (1) how to measure semantic distance on Linked Data in order to identify relatedness between resources, and (2) how such measures can be used to provide a new kind of self-explanatory recommendations, bringing together Linked Data and Artificial Intelligence principles, and demonstrating how intelligent agents could emerge in the realm of Linked Data.

In this paper, we propose a model of the web of data as a graph of interlinked graphs which goes beyond the standard single-graph RDF semantics, describe two different ways in which a query on this structure can be answered, and characterize semantically each of these ways in terms of restrictions on the relation between the domain of interpretation of each single component graph.

Some of the top legal ontologies developed so far include the Functional Ontology for Law [FOLaw] The increasing need for legal information and content (Valente 1995), the Frame-Based Ontology (van Kralingen management caused by the growing amount of 1995), the LRI-Core ontology (Breuker 2004), unstructured (or poorly structured) legal data managed by DOLCE CLO [Core Legal Ontology] (Gangemi et al. legal publishing companies, law firms and public 2003), or the Ontology of Fundamental Concepts (Rubino administrations, or the increasing amount of legal et al. 2006, Sartor 2006) the basis for the LKIF-Core information directly available on the World Wide Web, Ontology (Breuker et al. 2007). Nevertheless, most legal have created an urgent need to construct conceptual ontologies are domain specific ontologies, which represent structures for knowledge representation to share and particular legal domains towards search, indexing and manage intelligently all this information, whilst making reasoning in a specific domain of national or European law human-machine communication and understanding (e.g. the IPRONTO ontology by Delgado et al. 2003, the possible.