Extremal Separation Problems for Temporal Instance Queries
arxiv(2024)
摘要
The separation problem for a class Q of database queries is to find a query
in Q that distinguishes between a given set of `positive' and `negative' data
examples. Separation provides explanations of examples and underpins the
query-by-example paradigm to support database users in constructing and
refining queries. As the space of all separating queries can be large, it is
helpful to succinctly represent this space by means of its most specific
(logically strongest) and general (weakest) members. We investigate this
extremal separation problem for classes of instance queries formulated in
linear temporal logic LTL with the operators conjunction, next, and eventually.
Our results range from tight complexity bounds for verifying and counting
extremal separators to algorithms computing them.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要