default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Niskanen
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Christoph Jabs, Jeremias Berg
, Andreas Niskanen, Matti Järvisalo:
From Single-Objective to Bi-Objective Maximum Satisfiability Solving. J. Artif. Intell. Res. 80: 1223-1269 (2024)- [c26]Céline Hocquette, Andreas Niskanen, Matti Järvisalo, Andrew Cropper:
Learning MDL Logic Programs from Noisy Data. AAAI 2024: 10553-10561 - [c25]Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo:
Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. ECAI 2024: 3597-3604 - [c24]Tuomo Lehtonen, Andreas Niskanen, Matti Järvisalo:
SAT-Based Approaches to Reasoning in Choice Logics. ECAI 2024: 4271-4278 - [c23]Céline Hocquette, Andreas Niskanen, Rolf Morel, Matti Järvisalo, Andrew Cropper:
Learning Big Logical Rules by Joining Small Rules. IJCAI 2024: 3430-3438 - [e1]AnneMarie Borg, Stefan Ellmauthaler, Jean-Guy Mailly, Andreas Niskanen:
Proceedings of the Fifth International Workshop on Systems and Algorithms for Formal Argumentation co-located with 10th International Conference on Computational Models of Argument (COMMA 2024), Hagen, Germany, September 17th, 2024. CEUR Workshop Proceedings 3757, CEUR-WS.org 2024 [contents] - [i2]Céline Hocquette, Andreas Niskanen, Rolf Morel, Matti Järvisalo, Andrew Cropper:
Learning big logical rules by joining small rules. CoRR abs/2401.16215 (2024) - 2023
- [c22]Ari Conati, Andreas Niskanen, Matti Järvisalo:
SAT-based Judgment Aggregation. AAMAS 2023: 1412-1420 - [c21]Andreas Niskanen, Isabelle Kuhlmann, Matthias Thimm, Matti Järvisalo:
MaxSAT-Based Inconsistency Measurement. ECAI 2023: 1779-1786 - [c20]Isabelle Kuhlmann, Andreas Niskanen, Matti Järvisalo:
Computing MUS-Based Inconsistency Measures. JELIA 2023: 745-755 - [c19]Matti Järvisalo, Tuomo Lehtonen, Andreas Niskanen:
Design of ICCMA 2023, 5th International Competition on Computational Models of Argumentation: A Preliminary Report (invited paper). Arg&App@KR 2023: 4-10 - [i1]Céline Hocquette, Andreas Niskanen, Matti Järvisalo, Andrew Cropper:
Learning MDL logic programs from noisy data. CoRR abs/2308.09393 (2023) - 2022
- [j4]Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran:
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. Artif. Intell. 307: 103697 (2022) - [c18]Andreas Niskanen, Jere Mustonen, Jeremias Berg, Matti Järvisalo:
Computing Smallest MUSes of Quantified Boolean Formulas. LPNMR 2022: 301-314 - [c17]Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo:
MaxSAT-Based Bi-Objective Boolean Optimization. SAT 2022: 12:1-12:23 - [c16]Andreas Niskanen, Jeremias Berg, Matti Järvisalo:
Incremental Maximum Satisfiability. SAT 2022: 14:1-14:19 - 2021
- [j3]Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe:
Acceptance in incomplete argumentation frameworks. Artif. Intell. 295: 103470 (2021) - [c15]Andreas Niskanen, Jeremias Berg, Matti Järvisalo:
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. CP 2021: 44:1-44:19 - 2020
- [b1]Andreas Niskanen:
Computational Approaches to Dynamics and Uncertainty in Abstract Argumentation. University of Helsinki, Finland, 2020 - [c14]Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe:
Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI 2020: 2942-2949 - [c13]Andreas Niskanen, Matti Järvisalo:
Strong Refinements for Hard Problems in Argumentation Dynamics. ECAI 2020: 841-848 - [c12]Andreas Niskanen, Matti Järvisalo:
Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach. ECAI 2020: 849-856 - [c11]Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo:
Controllability of Control Argumentation Frameworks. IJCAI 2020: 1855-1861 - [c10]Andreas Niskanen, Matti Järvisalo:
Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation. KR 2020: 667-671 - [c9]Andreas Niskanen, Matti Järvisalo:
µ-toksia: An Efficient Abstract Argumentation Reasoner. KR 2020: 800-804
2010 – 2019
- 2019
- [j2]Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo:
Synthesizing Argumentation Frameworks from Examples. J. Artif. Intell. Res. 66: 503-554 (2019) - [c8]Wolfgang Dvorák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen, Stefan Woltran:
Preprocessing Argumentation Frameworks via Replacement Patterns. JELIA 2019: 116-132 - 2018
- [c7]Tuomo Lehtonen, Andreas Niskanen, Matti Järvisalo:
SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks. COMMA 2018: 193-204 - [c6]Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran:
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. IJCAI 2018: 1905-1911 - [c5]Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo:
Extension Enforcement under Grounded Semantics in Abstract Argumentation. KR 2018: 178-183 - 2017
- [j1]Johannes Peter Wallner, Andreas Niskanen, Matti Järvisalo:
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. J. Artif. Intell. Res. 60: 1-40 (2017) - 2016
- [c4]Johannes Peter Wallner, Andreas Niskanen, Matti Järvisalo:
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. AAAI 2016: 1088-1094 - [c3]Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo:
Synthesizing Argumentation Frameworks from Examples. ECAI 2016: 551-559 - [c2]Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo:
Optimal Status Enforcement in Abstract Argumentation. IJCAI 2016: 1216-1222 - [c1]Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo:
Pakota: A System for Enforcement in Abstract Argumentation. JELIA 2016: 385-400
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
