Efficiently Querying RDF(S) Ontologies with Answer Set Programming

DOI10.1093/logcom/exn043zbMath1192.68128OpenAlexW2160348326WikidataQ59216097 ScholiaQ59216097MaRDI QIDQ3395268

Alessandra Martello, Giorgio Terracina, Giovambattista Ianni, Claudio Panetta

Publication date: 24 August 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn043

zbMATH Keywords

knowledge representationanswer set programmingRDF ontologies

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (3)

Partial Compilation of ASP Programs ⋮ Extended RDF: computability and complexity issues ⋮ Adding Metalogic Features to Knowledge Representation Languages*

Uses Software

• DLV-EX
• SPARQL

This page was built for publication: Efficiently Querying RDF(S) Ontologies with Answer Set Programming