We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
Boris Konev, Roman Kontchakov, Michel Ludwig, Thom...
Data mining has emerged to address the problem of transforming data into useful knowledge. Although most data mining techniques, such as Association Rules, substantially reduce th...
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...