PP-2019-21: Answer Set Programming for Judgment Aggregation

PP-2019-21: de Haan, Ronald and Slavkovik, Marija (2019) Answer Set Programming for Judgment Aggregation. [Pre-print] (In Press)

[thumbnail of main.pdf]

Download (267kB) | Preview


Judgment aggregation (JA) studies how to aggregate truth valuations on logically related issues. Computing the outcome of aggregation procedures is notoriously computationally hard, which is the likely reason that no implementation of them exists as of yet. However, even hard problems sometimes need to be solved. The worst-case computational complexity of answer set programming (ASP) matches that of most problems in judgment aggregation. We take advantage of this and propose a natural and modular encoding of various judgment aggregation procedures and related problems in JA into ASP. With these encodings, we achieve two results: (1) paving the way towards constructing a wide range of new benchmark instances (from JA) for answer set solving algorithms; and (2) providing an automated tool for researchers in the area of judgment aggregation.

Item Type: Pre-print
Report Nr: PP-2019-21
Series Name: Prepublication (PP) Series
Year: 2019
Subjects: Computation
Depositing User: Dr Ronald de Haan
Date Deposited: 12 Aug 2019 13:54
Last Modified: 12 Aug 2019 13:54
URI: https://eprints.illc.uva.nl/id/eprint/1699

Actions (login required)

View Item View Item