A workshop at Universidad Simón Bolívar supported by the Spanish Agencia Española de Cooperación Internacional (AECI) under the project "Mecanismos de Optimización y Evaluación para consultar eficientemente la Web Semántica en la Administración Pública Electrónica".
Feb 11-12, 2008, Universidad Simón Bolívar, CBI Sala Multimedia de Post-Grado and CBI 140.
Speakers Abstracts Program&Materials Venue
Axel Polleres, DERI, National University of Ireland, Galway
The purpose of this tutorial is to get the audience familiar with
the Answer Set Programming (ASP) Paradigm in the perspective of
its fruitful usage for Semantic Web applications. ASP is a declarative
programming paradigm with its roots in Knowledge
Representation and Logic Programming.
Systems and languages based on ASP are ready for tackling many of the
challenges the Semantic Web offers, and in particular, are good
candidates for solving a variety of issues which have been delegated to
the Rule/Logic Layers in the Semantic Web vision. ASP systems
are scalable, allow to mix monotonic with nonmonotonic reasoning,
permit to combine rules with ontologies, and can interface external
reasoners. Moreover, ASP is especially tailored at solving
configuration and matchmaking problems involving reasoning with
preferences by featuring easy to use, fully declarative soft & hard
constraint specification languages.
We introduce the attendees to the ASP basics and its principal
extensions tailored at Semantic Web applications. We discuss the
current impact of Answer Set Programming in the Semantic Web Area and
possible future directions. Applications and exercises are
presented.
Amadís Antonio Martínez Morales, Universidad de
Carabobo, Venezuela, and
María Esther Vidal, Universidad Simón Bolívar,
Venezuela
RDF is a proposal of the W3C to express metadata about resources in the Web. The RDF data model allows several representations, each one with its own limitations at expressive power and support for the tasks of query answering and semantic reasoning. In this paper, we present a directed hypergraph model for RDF to represent RDF documents efficiently. We compare our approach with other proposals and we study its impact on the tasks of query answering and semantic inference. Finally, we explain the objectives that we plan to achieve in the context of this work.
Eduardo Blanco and María-Esther Vidal, Universidad Simón Bolívar, Venezuela
Elsa Tovar, Universidad de Carabobo, Venezuela
and María-Esther Vidal, Universidad Simón Bolívar,
Venezuela
Reactive data behavior
expresses
changes over data when events occur and data satisfy specific
conditions. The most widely used approach to process reactive
behavior is the ECA rules paradigm and has been extensively study by
the database and language communities. In the context of the Semantic
Web, reactive knowledge is encoded in ontologies by using ECA rules,
and
the events that fire these rules, are considered as
transactional data, which are independent of the classes and
properties represented in the ontology. Active knowledge cannot be
used to derive new properties of the data instances, and new reactive
behavior information cannot be inferred directly from the schema;
therefore, the power of the inference process is limited to what can
be inferred from the classes, properties and instances. In this
paper, we describe an alternative approach to aim the enrichment of
the Semantic Web with dynamism. In this talk, we propose an active
ontology
formalism to express reactive behavior. In our proposed
formalism,
events are categorized as first-class concepts of the ontology, and
in conjunction with classes, properties and instances, are considered
during the query answering and reasoning tasks.
Luis Ibáñez and Héctor Rodríguez and María-Esther Vidal, Universidad Simón Bolívar, Venezuela
Emerging technologies have make available a large number of data, which may be related to relevant and important objects. Popular authority-flow based ranking techniques have shown to be precise to discriminate hyperlinked objects in terms of relevance and importance; particularly, these ranking techniques are able to distinguish relevant and important objects or Golden objetcs. However, evaluating authority-flow based techniques is usually expensive in large datasets. In this talk, we present the problem of identifying Golden objects efficiently and we propose two approximated solutions to this problem. First, we propose a solution defined in terms of the Direct Sampling technique proposed to sample Bayesian networks. Second, we adapt paths sampling techniques to identy path that conduct to Golden objects. We conduct an experimental study on large biological datasets. Our experimental results show that the proposed techniques are able to identify the 90% of Golden objects, while time needed is less than 50% of the execution time of the exact solution.
Universidad Simón
Bolívar
, room CBI 140.
Valle de Sartenejas, Baruta
Caracas 1080, Venezuela
Contact person: Axel Polleres
Edna Ruckhaus,
María-Esther Vidal