电路复杂性满足基于本体的数据访问
Circuit Complexity Meets Ontology-Based Data Access
摘要：
基于本体的数据访问是一种利用逻辑理论来组织对数据库的访问的方法。在这种方法中，查询应答通过将给定的查询重新表述为可以在不使用任何理论的情况下回答的新查询来进行。因此，问题简化为标准数据库设置。然而，查询的大小可能在重构期间显著增加。在这次调查中，我们回顾了最近开发的框架，证明下限和上限的大小，这重新采用的方法和结果从布尔电路复杂性。
英文摘要：
Ontology-based data access is an approach to organizing access to a database augmented with a logical theory. In this approach query answering proceeds through a reformulation of a given query into a new one which can be answered without any use of theory. Thus the problem reduces to the standard database setting. However, the size of the query may increase substantially during the reformulation. In this survey we review a recently developed framework on proving lower and upper bounds on the size of this reformulation by employing methods and results from Boolean circuit complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
