Andreas Pfandler

According to our database, Andreas Pfandler authored at least 29 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Lower Bounds for QBFs of Bounded Treewidth.

Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Proportional Belief Merging.

Adrian Haret, Martin Lackner, Andreas Pfandler, Johannes Peter Wallner

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.

Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler

CoRR, 2019

Parameterized Complexity of Asynchronous Border Minimization.

Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa

Algorithmica, 2019

Backdoors to planning.

Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

Artif. Intell., 2019

2017

Computational Aspects of Nearly Single-Peaked Electorates.

Gábor Erdélyi, Martin Lackner, Andreas Pfandler

J. Artif. Intell. Res., 2017

Conformant planning as a case study of incremental QBF solving.

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler

Ann. Math. Artif. Intell., 2017

PPI17 - Vorwort.

Markus Endres, Andreas Pfandler

Proceedings of the Datenbanksysteme für Business, 2017

2016

Unsere Empfehlung für Sie: Präferenzen und Personalisierung in der Informatik.

Markus Endres, Andreas Pfandler

Proceedings of the 46. Jahrestagung der Gesellschaft für Informatik, 2016

Beyond IC Postulates: Classification Criteria for Merging Operators.

Adrian Haret, Andreas Pfandler, Stefan Woltran

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

The complexity of handling minimal solutions in logic-based abduction.

Andreas Pfandler, Reinhard Pichler, Stefan Woltran

J. Log. Comput., 2015

Intra- and interdiagram consistency checking of behavioral multiview models.

Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl

Comput. Lang. Syst. Struct., 2015

Distance-Bounded Consistent Query Answering.

Andreas Pfandler, Emanuel Sallinger

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Parameterized Complexity of Belief Revision.

Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Fixed-Parameter Tractable Reductions to SAT for Planning.

Ronald de Haan, Martin Kronegger, Andreas Pfandler

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Manipulation of k-Approval in Nearly Single-Peaked Electorates.

Gábor Erdélyi, Martin Lackner, Andreas Pfandler

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Democratix: A Declarative Approach to Winner Determination.

Günther Charwat, Andreas Pfandler

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Variable-Deletion Backdoors to Planning.

Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

A SAT-Based Debugging Tool for State Machines and Sequence Diagrams.

Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl

Proceedings of the Software Language Engineering - 7th International Conference, 2014

A Parameterized Complexity Analysis of Generalized CP-Nets.

Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines.

Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl

Proceedings of the 10th International Workshop on Model Driven Engineering, 2013

VCWC: A Versioning Competition Workflow Compiler.

Günther Charwat, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Andreas Pfandler, Christoph Redl, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

The Fourth Answer Set Programming Competition: Preliminary Report.

Mario Alviano, Francesco Calimeri, Günther Charwat, Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Jörg Pührer, Christoph Redl, Francesco Ricca, Patrik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Backdoors to Abduction.

Andreas Pfandler, Stefan Rümmele, Stefan Szeider

Proceedings of the IJCAI 2013, 2013

Parameterized Complexity of Optimal Planning: A Detailed Map.

Martin Kronegger, Andreas Pfandler, Reinhard Pichler

Proceedings of the IJCAI 2013, 2013

2012

Fixed-Parameter Algorithms for Finding Minimal Models.

Martin Lackner, Andreas Pfandler

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Train Marshalling Is Fixed Parameter Tractable.

Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Fixed-Parameter Algorithms for Closed World Reasoning.

Martin Lackner, Andreas Pfandler

Proceedings of the ECAI 2012, 2012

The Parameterized Complexity of Abduction.

Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012