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)