Efficiently Querying RDF(S) Ontologies with Answer Set Programming

DOI10.1093/LOGCOM/EXN043MaRDI QIDQ3395268zbMATH OpenOpenAlexWikidataFDO

Authors Giovambattista Ianni, Alessandra Martello, Claudio Panetta, G. Terracina

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

answer set programmingknowledge representationRDF ontologies

Mathematics Subject Classification ID

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

Recommendations

• Query answering over description logic ontologies
• Open answer set programming for the semantic web
• Query answering in resource-based answer set semantics
• An efficient SQL-based querying method to RDF schemata
• Towards more expressive ontology languages: the query answering problem

Cited in

(8)

• Evolution of ontologies using ASP
• On the relation between SPARQL1.1 and Answer Set Programming
• Partial compilation of ASP programs
• Adding Metalogic Features to Knowledge Representation Languages*
• Efficient distributed query processing on large scale RDF graph data
• An efficient SQL-based querying method to RDF schemata
• Cooperative Query Answering for RDF
• Extended RDF: computability and complexity issues

Describes a project that uses

Uses Software

• DLV-EX
• SPARQL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395268)