RDF Querying as a Constraint Satisfaction Problem

From Master Projects
Jump to: navigation, search

RDF Querying as a Constraint Satisfaction Problem
status: finished
Master: project within::Technical Artificial Intelligence
Student name: student name::Amanuel Alemayehu Koshima
number: student number::1735780
Start start date:=2009/02/20
End end date:=2009/08/20
Supervisor: Stefan Schlobach
Second reader: has second reader::Christophe Guéret
Company: has company::Vrije Universiteit Amsterdam
Poster: has poster::Media:Abstact Amanuel.pdf

Signature supervisor



KIM 1: Abstract

Presentation date: May 28, 2009

The Resource Description Framework (RDF) has accepted as a standard method for representing semantics of resources in machine understandable format. In recent years, a large part of data on the web are represented on the RDF standard and as a result of this, we need an efficient and effective way for handling RDF based systems. In the past, many approaches have been proposed for querying RDF based datasets. The Simple Protocol and RDF Query Language (SPARQL) has been recommended by the W3C communities for querying RDF based datasets. In this work, we propose a new approach for querying RDF datasets by encoding a problem (both RDF and SPARQL) into Constraint Satisfaction Problem (CSP) and solve them by employing an efficient CSP solver. In particular we translate RDF/SPARQL graph to XML representation of Constraint Networks (XCSP).