arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.04758cs.AI
收藏

求具有分支割和价格的最小费用Herbrand模型

Finding Minimal Cost Herbrand Models with Branch-Cut-and-Price

University of York(约克大学)

James Cussens

摘要:

给定(1)某种一阶语言$\cal L$中的一组子句$T$和(2)将Herbrand基$B_{\cal L}$中的每个基原子映射到非负实数的代价函数$c : B_{\cal L} \rightarrow \mathbb{R}_{+}$,则找到最小代价Herbrand模型的问题是找到保证使真实基原子的代价之和最小化的$T$的Herbrand模型$\cal I$,或确定$T$不存在Herbrand模型。提出了一种求解该问题的分枝割价整数规划方法。由于子句的基实例的数目和Herbrand基的大小一般都是无限的,我们分别通过“切割”和“定价”添加相应的IP约束和IP变量“on the fly”。在有限Herbrand基地的特殊情况下,我们表明,从一开始就添加所有的IP变量和约束可以是有利的,显示一个具有挑战性的马尔可夫逻辑网络MAP问题可以解决这种方式,如果适当编码。

英文摘要:

Given (1) a set of clauses $T$ in some first-order language $\cal L$ and (2) a cost function $c : B_{\cal L} \rightarrow \mathbb{R}_{+}$, mapping each ground atom in the Herbrand base $B_{\cal L}$ to a non-negative real, then the problem of finding a minimal cost Herbrand model is to either find a Herbrand model $\cal I$ of $T$ which is guaranteed to minimise the sum of the costs of true ground atoms, or establish that there is no Herbrand model for $T$. A branch-cut-and-price integer programming (IP) approach to solving this problem is presented. Since the number of ground instantiations of clauses and the size of the Herbrand base are both infinite in general, we add the corresponding IP constraints and IP variables `on the fly' via `cutting' and `pricing' respectively. In the special case of a finite Herbrand base we show that adding all IP variables and constraints from the outset can be advantageous, showing that a challenging Markov logic network MAP problem can be solved in this way if encoded appropriately.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑