从闭包中学习定角公式
Learning Definite Horn Formulas from Closure Queries
摘要:
一个确定的Horn理论是一组n维布尔向量,其特征函数可以表示为一个确定的Horn公式,即确定Horn子句的合取。已知一类定角理论在不同的查询学习设置下是可学习的,例如从成员和等价查询学习或从蕴涵学习。我们还提出了一种不同类型的查询:闭包查询。闭包查询是成员查询的自然扩展,也是所谓的校正查询的变体,适用于定Horn公式的上下文中。我们提出了一个算法,学习合取的明确霍恩子句在多项式时间,使用封闭和等价查询,并显示它如何涉及到典型的Guigues-Duquenne基础的蕴涵系统。我们还展示了不同的查询模型是如何相互关联的,要么通过查询模拟(在可能的情况下)显示全面的减少,要么通过显示它们的连接在特定的算法,使用它们学习明确的霍恩公式的上下文中。
英文摘要:
A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories is known to be learnable under different query learning settings, such as learning from membership and equivalence queries or learning from entailment. We propose yet a different type of query: the closure query. Closure queries are a natural extension of membership queries and also a variant, appropriate in the context of definite Horn formulas, of the so-called correction queries. We present an algorithm that learns conjunctions of definite Horn clauses in polynomial time, using closure and equivalence queries, and show how it relates to the canonical Guigues-Duquenne basis for implicational systems. We also show how the different query models mentioned relate to each other by either showing full-fledged reductions by means of query simulation (where possible), or by showing their connections in the context of particular algorithms that use them for learning definite Horn formulas.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。