Computing CQ lower-bounds over OWL 2 through approximation to RSA.
Federico IgneStefano GermanoIan HorrocksPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- np hard
- knowledge base
- knowledge representation
- branch and bound
- branch and bound algorithm
- efficient computation
- polynomial approximation
- objective function
- conjunctive queries
- upper and lower bounds
- public key
- approximation ratio
- integrality gap
- min sum
- key exchange
- constant factor
- approximation algorithms