Finite Open-world Query Answering with Number Restrictions

ACM Transactions on Computational Logic, pp. 1-73, 2020.

Cited by: 0|Bibtex|Views11|Links
EI
Keywords:
FDsFinite controllabilityUIDschase

Abstract:

Open-world query answering is the problem of deciding, given a set of facts, conjunction of constraints, and query, whether the facts and constraints imply the query. This amounts to reasoning over all instances that include the facts and satisfy the constraints. We study finite open-world query answering (FQA), which assumes that the und...More

Code:

Data:

Your rating :
0

 

Tags
Comments