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...
Hoofdauteurs: | Amarilli, A, Benedikt, M |
---|---|
Formaat: | Journal article |
Taal: | English |
Gepubliceerd in: |
Association for Computing Machinery
2020
|
Gelijkaardige items
-
Query answering with transitive and linear-ordered data
door: Vanden Boom, M, et al.
Gepubliceerd in: (2016) -
Query answering with transitive and linear-ordered data
door: Amarilli, A, et al.
Gepubliceerd in: (2018) -
When can we answer queries using result-bounded data interfaces?
door: Amarilli, A, et al.
Gepubliceerd in: (2018) -
When Can We Answer Queries Using Result-Bounded Data Interfaces?
door: Antoine Amarilli, et al.
Gepubliceerd in: (2022-06-01) -
Querying schemas with access restrictions
door: Benedikt, M, et al.
Gepubliceerd in: (2012)