{"id":"https://openalex.org/W2966767866","doi":"https://doi.org/10.24963/ijcai.2019/231","title":"Answer Set Programming for Judgment Aggregation","display_name":"Answer Set Programming for Judgment Aggregation","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2966767866","doi":"https://doi.org/10.24963/ijcai.2019/231","mag":"2966767866"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/231","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/231","pdf_url":"https://www.ijcai.org/proceedings/2019/0231.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0231.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ronald de Haan","raw_affiliation_strings":["Institute for Logic, Language and Computation (ILLC), University of Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation (ILLC), University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031805291","display_name":"Marija Slavkovik","orcid":"https://orcid.org/0000-0003-2548-8623"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Marija Slavkovik","raw_affiliation_strings":["University of Bergen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031805291"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.3277,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.60006723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1668","last_page":"1674"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.8130789995193481},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.7945648431777954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.768781840801239},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6530015468597412},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6452362537384033},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6426631212234497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4651283919811249},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4559831917285919},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.4506438672542572},{"id":"https://openalex.org/keywords/aggregation-problem","display_name":"Aggregation problem","score":0.44246309995651245},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.422147274017334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24061894416809082},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17728498578071594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1157066822052002},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.08100184798240662}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8130789995193481},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.7945648431777954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.768781840801239},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6530015468597412},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6452362537384033},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6426631212234497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4651283919811249},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4559831917285919},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.4506438672542572},{"id":"https://openalex.org/C32172795","wikidata":"https://www.wikidata.org/wiki/Q4692266","display_name":"Aggregation problem","level":2,"score":0.44246309995651245},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.422147274017334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24061894416809082},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17728498578071594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1157066822052002},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.08100184798240662},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.24963/ijcai.2019/231","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/231","pdf_url":"https://www.ijcai.org/proceedings/2019/0231.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/0b36f519-b820-4c49-a881-32ee2350b8f3","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/answer-set-programming-for-judgment-aggregation(0b36f519-b820-4c49-a881-32ee2350b8f3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Haan, R & Slavkovik, M 2019, Answer Set Programming for Judgment Aggregation. in S Kraus (ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence : IJCAI-19 : Macao, 10-16 August 2019. pp. 1668-1674, International Joint Conference on Artificial Intelligence (IJCAI) 2019, Macao, China, 10/08/19. https://doi.org/10.24963/ijcai.2019/231","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dare.uva.nl:publications/0b36f519-b820-4c49-a881-32ee2350b8f3","is_oa":false,"landing_page_url":"https://hdl.handle.net/11245.1/0b36f519-b820-4c49-a881-32ee2350b8f3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Haan, R & Slavkovik, M 2019, Answer Set Programming for Judgment Aggregation. in S Kraus (ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence : IJCAI-19 : Macao, 10-16 August 2019. pp. 1668-1674, International Joint Conference on Artificial Intelligence (IJCAI) 2019, Macao, China, 10/08/19. https://doi.org/10.24963/ijcai.2019/231","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/0b36f519-b820-4c49-a881-32ee2350b8f3","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/answer-set-programming-for-judgment-aggregation(0b36f519-b820-4c49-a881-32ee2350b8f3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence: IJCAI-19 : Macao, 10-16 August 2019, 1668 - 1674","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/231","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/231","pdf_url":"https://www.ijcai.org/proceedings/2019/0231.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2966767866.pdf","grobid_xml":"https://content.openalex.org/works/W2966767866.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W31301090","https://openalex.org/W43521781","https://openalex.org/W92491003","https://openalex.org/W1482532598","https://openalex.org/W1999561830","https://openalex.org/W2014337128","https://openalex.org/W2039887949","https://openalex.org/W2087432892","https://openalex.org/W2103124377","https://openalex.org/W2127122515","https://openalex.org/W2142550658","https://openalex.org/W2170386081","https://openalex.org/W2273120672","https://openalex.org/W2343762677","https://openalex.org/W2399970419","https://openalex.org/W2462596823","https://openalex.org/W2490950911","https://openalex.org/W2511744811","https://openalex.org/W2577448541","https://openalex.org/W2577674886","https://openalex.org/W2620813584","https://openalex.org/W2620961724","https://openalex.org/W2807917995","https://openalex.org/W2843957561","https://openalex.org/W2885913157","https://openalex.org/W2950910475","https://openalex.org/W3102950188","https://openalex.org/W4206807714","https://openalex.org/W4300107901","https://openalex.org/W6704835266","https://openalex.org/W6719591193","https://openalex.org/W6732232356"],"related_works":["https://openalex.org/W2092211394","https://openalex.org/W3123634980","https://openalex.org/W4224091818","https://openalex.org/W1576629166","https://openalex.org/W319703841","https://openalex.org/W2756703666","https://openalex.org/W2002245211","https://openalex.org/W3125340626","https://openalex.org/W2966767866","https://openalex.org/W1479091593"],"abstract_inverted_index":{"Judgment":[0],"aggregation":[1,17,78],"(JA)":[2],"studies":[3],"how":[4],"to":[5,43],"aggregate":[6],"truth":[7],"valuations":[8],"on":[9],"logically":[10],"related":[11,81],"issues.":[12],"Computing":[13],"the":[14,25,96,123],"outcome":[15],"of":[16,31,35,50,57,66,75,103,125],"procedures":[18,79],"is":[19,24],"notoriously":[20],"computationally":[21],"hard,":[22],"which":[23],"likely":[26],"reason":[27],"that":[28,56],"no":[29],"implementation":[30],"them":[32],"exists":[33],"as":[34],"yet.":[36],"However,":[37],"even":[38],"hard":[39],"problems":[40,59,82],"sometimes":[41],"need":[42],"be":[44],"solved.":[45],"The":[46],"worst-case":[47],"computational":[48],"complexity":[49],"answer":[51,110],"set":[52,111],"programming":[53],"(ASP)":[54],"matches":[55],"most":[58],"in":[60,83,122],"judgment":[61,77,126],"aggregation.":[62,127],"We":[63],"take":[64],"advantage":[65],"this":[67],"and":[68,72,80,114],"propose":[69],"a":[70,100],"natural":[71],"modular":[73],"encoding":[74],"various":[76],"JA":[84],"into":[85],"ASP.":[86],"With":[87],"these":[88],"encodings,":[89],"we":[90],"achieve":[91],"two":[92],"results:":[93],"(1)":[94],"paving":[95],"way":[97],"towards":[98],"constructing":[99],"wide":[101],"range":[102],"new":[104],"benchmark":[105],"instances":[106],"(from":[107],"JA)":[108],"for":[109,120],"solving":[112],"algorithms;":[113],"(2)":[115],"providing":[116],"an":[117],"automated":[118],"tool":[119],"researchers":[121],"area":[124]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}