摘要翻译:
针对最大生成树问题的决策支持系统,提出了一种新的完全可计算问题:优先一致性问题。为了显示它的兴趣,我们描述了一种新的生成树偏好的紧凑表示,识别了一个有效的最大生成树子问题。然后,我们将该问题与基于Pareto的多目标问题进行了比较。最后,我们提出了一个解决相关优先一致性问题的有效算法。
---
英文标题:
《Global preferential consistency for the topological sorting-based
maximal spanning tree problem》
---
作者:
R\'emy-Robert Joseph
---
最新提交年份:
2012
---
分类信息:
一级分类: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中的材料。
--
一级分类:Computer Science 计算机科学
二级分类:Discrete Mathematics 离散数学
分类描述:Covers combinatorics, graph theory, applications of probability. Roughly includes material in ACM Subject Classes G.2 and G.3.
涵盖组合学,图论,概率论的应用。大致包括ACM学科课程G.2和G.3中的材料。
--
---
英文摘要:
We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show its interest, we describe a new compact representation of preferences specific to spanning trees, identifying an efficient maximal spanning tree sub-problem. Next, we compare this problem with the Pareto-based multiobjective one. And at last, we propose an efficient algorithm solving the associated preferential consistency problem.
---
PDF链接:
https://arxiv.org/pdf/1203.6534