arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0705.0734cs.AI
收藏

基于半环同态的软约束抽象

Soft constraint abstraction based on semiring homomorphism

Tsinghua University(清华大学)

Sanjiang Li, Mingsheng Ying

摘要:

Bistarelli,Montanari和Rossi \cite{BMR97}提出的基于半环的约束满足问题(semi-ring constraint satisfaction problems,Semi-ring CSP)是一个非常一般的软约束框架。在本文中,我们提出了一个抽象的计划,软约束,使用半环同态。为了找到具体问题的最优解,其思想是,首先处理抽象问题并找到其最优解,然后使用它们来解决具体问题。特别地,我们证明了一个映射保持最优解的充要条件是它是一个序反射半环同态。此外,对于半环同态$α$和$S$上的问题$P$,如果$t$在$α(P)$中是最优的,则存在$P$的最优解$\bar{t}$,使得$\bar{t}$在$α(P)$中与$t$具有相同的值。

英文摘要:

The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal solutions, then using them to solve the concrete problem. In particular, we show that a mapping preserves optimal solutions if and only if it is an order-reflecting semiring homomorphism. Moreover, for a semiring homomorphism $α$ and a problem $P$ over $S$, if $t$ is optimal in $α(P)$, then there is an optimal solution $\bar{t}$ of $P$ such that $\bar{t}$ has the same value as $t$ in $α(P)$.

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

↑