Catálogo de publicaciones - libros

Compartir en
redes sociales


Web Reasoning and Rule Systems: First International Conference, RR 2007, Innsbruck, Austria, June 7-8, 2007, Proceedings

Massimo Marchiori ; Jeff Z. Pan ; Christian de Sainte Marie (eds.)

En conferencia: 1º International Conference on Web Reasoning and Rule Systems (RR) . Innsbruck, Austria . June 7, 2007 - June 8, 2007

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Information Systems Applications (incl. Internet); Information Storage and Retrieval; Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs; Multimedia Information Systems; Software Engineering

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2007 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-540-72981-5

ISBN electrónico

978-3-540-72982-2

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag Berlin Heidelberg 2007

Tabla de contenidos

Efficiently Querying Relational Databases Using OWL and SWRL

Martin O’Connor; Ravi Shankar; Samson Tu; Csongor Nyulas; Amar Das; Mark Musen

For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge the two models are required. Mapping all relational data to ontology instances is often not practical so dynamic data access approaches are typically employed, though these approaches can still suffer from scalability problems. The use of rules with these systems presents an opportunity to employ optimization techniques that can significantly reduce the amount of data transferred from databases. To illustrate this premise, we have developed tools that allow direct access to relational data from OWL applications. We express these data requirements by using extensions to OWL’s rule language SWRL. A variety of optimization techniques ensure that this process is efficient and scales to large data sets.

- III Selected Posters | Pp. 361-363

Top-Down Computation of the Semantics of Weighted Fuzzy Logic Programs

Alexandros Chortaras; Giorgos Stamou; Andreas Stafylopatis

We describe a procedural, query answering-oriented semantics for weighted fuzzy logic programs. The computation of the semantics combines resolution with tabling methodologies and is done by constructing and evaluating an appropriate resolution graph.

- III Selected Posters | Pp. 364-366

A Visualization Algorithm for Defeasible Logic Rule Bases over RDF Data

Efstratios Kontopoulos; Nick Bassiliades; Grigoris Antoniou

This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produced that represents the rule base. The graph features distinct node types for rules and atomic formulas and distinct connection types for the various rule types of defeasible logic.

- III Selected Posters | Pp. 367-369

Efficient OWL Reasoning with Logic Programs – Evaluations

Sebastian Rudolph; Markus Krötzsch; Pascal Hitzler; Michael Sintek; Denny Vrandecic

We report on efficiency evaluations concerning two different approaches to using logic programming for OWL [1] reasoning and show, how the two approaches can be combined.

- III Selected Posters | Pp. 370-373

Reasoning About XML Schema Mappings in the Presence of Key Constraints and Value Dependencies

Tadeusz Pankowski; Jolanta Cybulka; Adam Meissner

Schema mappings play a central role in both data integration and data exchange, and are understood as high-level specifications describing the relationships between data schemas. Based on these specifications, data structured under a source schema can be transformed into data structured under a target schema. During the transformation some structural constraints, both contextfree (the structure) and contextual (e.g. keys and value dependencies) should be taken into account. In this work, we present a formalism for schema mapping specification taking into account key constraints and value dependencies. The formalism extends results from [1,2], and our previous work [3,4]. We illustrate the approach by an example.

- III Selected Posters | Pp. 374-376

Context in Rules Used in P2P Semantic Data Integration System

Grażyna Brzykcy; Jerzy Bartoszek

We use situation theory to model context of agents’ actions in heterogeneous P2P system of semantic data integration. This formal basis is also suitable to cope with information partiality, open-world and non-monotonic reasoning. Operational semantics of asking and answering queries by the agents is presented as a set of context-dependent rules. Situations are represented by facts and rules and Prolog-like reasoning mechanisms are used in the system. Specification of sample actions is presented.

- III Selected Posters | Pp. 377-380