A Perfect Match for Reasoning, Explanation, and Reason Maintenance

Kotowski, Jakub and Bry, François (2009): A Perfect Match for Reasoning, Explanation, and Reason Maintenance. In: Polleres, Axel (ed.) : Web reasoning and rule systems : third international conference, RR 2009, Chantilly, VA, USA, October 25 - 26, 2009 ; proceedings. Vol. 5837. Berlin: Springer. pp. 227-241

Abstract

Path query languages have been previously shown to com- plement RDF rule languages in a natural way and have been used as a means to implement the RDFS derivation rules. RPL is a novel path query language specifically designed to be incorporated with RDF rules and comes in three avors: Node-, edge- and path- avored expressions allow to express conditional regular expressions over the nodes, edges, or nodes and edges appearing on paths within RDF graphs. Providing reg- ular string expressions and negation, RPL is more expressive than other RDF path languages that have been proposed. We give a compositional semantics for RPL and show that it can be evaluated efficiently, while several possible extensions of it cannot.

• Item Type: Conference or Workshop Item (Report)
• Faculties: Mathematics, Computer Science and Statistics > Computer Science
• Subjects: 000 Computer science, information and general works > 004 Data processing computer science
• Place of Publication: Berlin
• Annotation: The final publication is available at link.springer.com. DOI:10.1007/978-3-642-05082-4_16
• Language: English