Andreas Niskanen

Orcid: 0000-0003-3197-2075

Affiliations:
  • University of Helsinki, Finland


According to our database1, Andreas Niskanen authored at least 30 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
From Single-Objective to Bi-Objective Maximum Satisfiability Solving.
J. Artif. Intell. Res., 2024

Learning Big Logical Rules by Joining Small Rules.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

SAT-Based Approaches to Reasoning in Choice Logics.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Learning MDL Logic Programs from Noisy Data.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Design of ICCMA 2023, 5th International Competition on Computational Models of Argumentation: A Preliminary Report (invited paper).
Proceedings of the First International Workshop on Argumentation and Applications co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023), 2023

Computing MUS-Based Inconsistency Measures.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

MaxSAT-Based Inconsistency Measurement.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

SAT-based Judgment Aggregation.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.
Artif. Intell., 2022

Incremental Maximum Satisfiability.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

MaxSAT-Based Bi-Objective Boolean Optimization.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Computing Smallest MUSes of Quantified Boolean Formulas.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

2021
Acceptance in incomplete argumentation frameworks.
Artif. Intell., 2021

Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Computational Approaches to Dynamics and Uncertainty in Abstract Argumentation.
PhD thesis, 2020

µ-toksia: An Efficient Abstract Argumentation Reasoner.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Controllability of Control Argumentation Frameworks.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Strong Refinements for Hard Problems in Argumentation Dynamics.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Deciding Acceptance in Incomplete Argumentation Frameworks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Synthesizing Argumentation Frameworks from Examples.
J. Artif. Intell. Res., 2019

Preprocessing Argumentation Frameworks via Replacement Patterns.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018
Extension Enforcement under Grounded Semantics in Abstract Argumentation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks.
Proceedings of the Computational Models of Argument, 2018

2017
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.
J. Artif. Intell. Res., 2017

2016
Pakota: A System for Enforcement in Abstract Argumentation.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Optimal Status Enforcement in Abstract Argumentation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016


  Loading...