一类最大可处理软约束

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

摘要翻译：
许多人工智能研究人员开始探索使用软约束来表达一组（可能相互冲突的）问题需求。软约束是一个定义在变量集合上的函数，它将期望的某种度量与这些变量的每个可能的值组合相关联。然而，对于寻找软约束集合的最优解的计算复杂性这一关键问题，迄今很少受到关注。本文给出了一类软二元约束的最优解求解问题。换句话说，我们证明了对于任意给定的约束集，存在一个多项式时间算法来确定具有最佳总体合意性综合测度的分配。这个易于处理的类包括许多常见的软约束，如“尽可能近”或“尽可能快”，以及“大于”等简洁的约束。最后，我们证明了这个可处理类是极大的，因为在这个可处理类中添加任何其它形式的软二元约束都会产生一类NP-hard问题。
---
英文标题：
《A Maximal Tractable Class of Soft Constraints》
---
作者：
D. Cohen, M. Cooper, P. Jeavons, A. Krokhin
---
最新提交年份：
2011
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates some measure of desirability with each possible combination of values for those variables. However, the crucial question of the computational complexity of finding the optimal solution to a collection of soft constraints has so far received very little attention. In this paper we identify a class of soft binary constraints for which the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly-occurring soft constraints, such as 'as near as possible' or 'as soon as possible after', as well as crisp constraints such as 'greater than'. Finally, we show that this tractable class is maximal, in the sense that adding any other form of soft binary constraint which is not in the class gives rise to a class of problems which is NP-hard.
---
PDF链接：
https://arxiv.org/pdf/1107.0043

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：软约束 Intelligence Presentation Requirements Constraints possible 使用 总体 solution constraints