Andreas Pfandler

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Lower Bounds for QBFs of Bounded Treewidth.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Proportional Belief Merging.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

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

2017
PPI17 - Vorwort.
Proceedings of the Datenbanksysteme für Business, 2017

2016
Unsere Empfehlung für Sie: Präferenzen und Personalisierung in der Informatik.
Proceedings of the 46. Jahrestagung der Gesellschaft für Informatik, 2016

Beyond IC Postulates: Classification Criteria for Merging Operators.
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.
J. Log. Comput., 2015

Intra- and interdiagram consistency checking of behavioral multiview models.
Comput. Lang. Syst. Struct., 2015

Parameterized Complexity of Asynchronous Border Minimization.
Proceedings of the Theory and Applications of Models of Computation, 2015

Distance-Bounded Consistent Query Answering.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Parameterized Complexity of Belief Revision.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Fixed-Parameter Tractable Reductions to SAT for Planning.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Manipulation of k-Approval in Nearly Single-Peaked Electorates.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Democratix: A Declarative Approach to Winner Determination.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Variable-Deletion Backdoors to Planning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
A SAT-Based Debugging Tool for State Machines and Sequence Diagrams.
Proceedings of the Software Language Engineering - 7th International Conference, 2014

Conformant Planning as a Case Study of Incremental QBF Solving.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2014

Backdoors to Planning.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

A Parameterized Complexity Analysis of Generalized CP-Nets.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines.
Proceedings of the 10th International Workshop on Model Driven Engineering, 2013

VCWC: A Versioning Competition Workflow Compiler.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013


Backdoors to Abduction.
Proceedings of the IJCAI 2013, 2013

Parameterized Complexity of Optimal Planning: A Detailed Map.
Proceedings of the IJCAI 2013, 2013

Computational Aspects of Nearly Single-Peaked Electorates.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Fixed-Parameter Algorithms for Finding Minimal Models.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Train Marshalling Is Fixed Parameter Tractable.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Fixed-Parameter Algorithms for Closed World Reasoning.
Proceedings of the ECAI 2012, 2012

The Parameterized Complexity of Abduction.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012


  Loading...