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

寻找易于处理的判断聚合语言

Hunting for Tractable Languages for Judgment Aggregation

Institute for Logic, Language and Computation(逻辑、语言与计算研究所);University of Amsterdam(阿姆斯特丹大学)

Ronald de Haan

摘要:

判断聚合是集体决策的一般框架,可用于模拟许多不同的设置。由于其一般性质,在这个框架中基本上所有相关问题的最坏情况复杂性都非常高。然而,这些棘手的结果主要是由于这样一个事实,即表示聚合域的语言是过度表达。我们开始了一项调查的表示语言的判断聚合,罢工之间的平衡(1)是有限的,足以产生计算易处理的结果和(2)表达足够的模型相关的应用程序。特别是,我们考虑的语言克罗姆公式,(明确)霍恩公式,和布尔电路的可分解否定范式(DNNF)。我们用一个具体的应用程序来说明我们为这些语言获得的正复杂性结果的使用:投票决定如何花费预算(即,参与预算)。

英文摘要:

Judgment aggregation is a general framework for collective decision making that can be used to model many different settings. Due to its general nature, the worst case complexity of essentially all relevant problems in this framework is very high. However, these intractability results are mainly due to the fact that the language to represent the aggregation domain is overly expressive. We initiate an investigation of representation languages for judgment aggregation that strike a balance between (1) being limited enough to yield computational tractability results and (2) being expressive enough to model relevant applications. In particular, we consider the languages of Krom formulas, (definite) Horn formulas, and Boolean circuits in decomposable negation normal form (DNNF). We illustrate the use of the positive complexity results that we obtain for these languages with a concrete application: voting on how to spend a budget (i.e., participatory budgeting).

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

↑