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...
Những tác giả chính: | Amarilli, A, Benedikt, M |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
Association for Computing Machinery
2020
|
Những quyển sách tương tự
-
Query answering with transitive and linear-ordered data
Bằng: Vanden Boom, M, et al.
Được phát hành: (2016) -
Query answering with transitive and linear-ordered data
Bằng: Amarilli, A, et al.
Được phát hành: (2018) -
When can we answer queries using result-bounded data interfaces?
Bằng: Amarilli, A, et al.
Được phát hành: (2018) -
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Bằng: Antoine Amarilli, et al.
Được phát hành: (2022-06-01) -
Querying schemas with access restrictions
Bằng: Benedikt, M, et al.
Được phát hành: (2012)