Computing CQ lower-bounds over OWL 2 through approximation to RSA - Extended Abstract.
Federico IgneStefano GermanoIan HorrocksPublished in: ISWC (Posters/Demos/Industry) (2021)
Keyphrases
- extended abstract
- lower bound
- upper bound
- semantic web
- branch and bound algorithm
- branch and bound
- efficient computation
- semantic web technologies
- approximation algorithms
- conjunctive queries
- knowledge representation
- np hard
- knowledge base
- upper and lower bounds
- owl ontologies
- constant factor
- randomized algorithm
- polynomial approximation
- error bounds
- optimal solution
- databases
- lower and upper bounds
- approximation ratio
- objective function
- approximation guarantees
- database