most citedA Framework for Easing the Development of Applications Embedding Answer Set Programming

17 citations · 18 across the 2 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2021

Computing CQ lower-bounds over OWL 2 through approximation to RSA

Federico Igne, Stefano Germano, Ian Horrocks

Conjunctive query (CQ) answering over knowledge bases is an important reasoning task. However, with expressive ontology languages such as OWL, query answering is computationally ve…