An efficient light solver for querying the semantic web

le Clément de Saint Marcq, Vianney;Deville, Yves;Solnon, Christine
(2011) Principles and Practice of Constraint Programming. 17th International Conference, CP 2011 — Location: Perugia, Italy (12.September.2011)

Files

fulltext1.pdf
  • Open Access
  • Adobe PDF
  • 277.47 KB
Download

Details

Authors
  • le Clément de Saint Marcq, VianneyUCLouvain
    Author
  • Deville, Yvesorcid-logoUCLouvain
    Author
  • Solnon, ChristineUniversité de Lyon, Villeurbanne, France
    Author
Abstract
The Semantic Web aims at building cross-domain and distributed databases across the Internet. SPARQL is a standard query language for such databases. Evaluating such queries is however NP-hard. We model SPARQL queries in a declarative way, by means of CSPs. A CP operational semantics is proposed. It can be used for a direct implementation in existing CP solvers. To handle large databases, we introduce a specialized and efficient light solver, Castor. Benchmarks show the feasibility and efficiency of the approach.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

le Clément de Saint Marcq, V., Deville, Y., & Solnon, C. (2011). An efficient light solver for querying the semantic web. Lecture Notes in Computer Science, 6876, 145-159. https://doi.org/10.1007/978-3-642-23786-7_13 (Original work published 2011)