Finite open-world query answering with number restrictions
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 ans...
Үндсэн зохиолчид: | Amarilli, A, Benedikt, M |
---|---|
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
Association for Computing Machinery
2020
|
Ижил төстэй зүйлс
-
Query answering with transitive and linear-ordered data
-н: Vanden Boom, M, зэрэг
Хэвлэсэн: (2016) -
Query answering with transitive and linear-ordered data
-н: Amarilli, A, зэрэг
Хэвлэсэн: (2018) -
When can we answer queries using result-bounded data interfaces?
-н: Amarilli, A, зэрэг
Хэвлэсэн: (2018) -
When Can We Answer Queries Using Result-Bounded Data Interfaces?
-н: Antoine Amarilli, зэрэг
Хэвлэсэн: (2022-06-01) -
Querying schemas with access restrictions
-н: Benedikt, M, зэрэг
Хэвлэсэн: (2012)