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

類似資料