Pichler, Reinhard

14 publications

IJCAI 2020 Fast and Parallel Decomposition of Constraint Satisfaction Problems Georg Gottlob, Cem Okulmus, Reinhard Pichler

IJCAI 2020 Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler

IJCAI 2018 Computing the Schulze Method for Large-Scale Preference Data Sets Theresa Csar, Martin Lackner, Reinhard Pichler

IJCAI 2017 On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks Markus Kröll, Reinhard Pichler, Stefan Woltran

AAAI 2017 Winner Determination in Huge Elections with MapReduce Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger

AAAI 2014 A Parameterized Complexity Analysis of Generalized CP-Nets Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler

AAAI 2014 Capturing Relational Schemas and Functional Dependencies in RDFS Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, Mantas Simkus

IJCAI 2013 Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Nadia Creignou, Reinhard Pichler, Stefan Woltran

IJCAI 2013 Parameterized Complexity of Optimal Planning: A Detailed mAP Martin Kronegger, Andreas Pfandler, Reinhard Pichler

IJCAI 2009 Answer-Set Programming with Bounded Treewidth Michael Jakl, Reinhard Pichler, Stefan Woltran

AAAI 2008 Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation Georg Gottlob, Reinhard Pichler, Fang Wei

IJCAI 2007 Counting Complexity of Propositional Abduction Miki Hermann, Reinhard Pichler

AAAI 2007 Efficient Datalog Abduction Through Bounded Treewidth Georg Gottlob, Reinhard Pichler, Fang Wei

AAAI 2006 Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning Georg Gottlob, Reinhard Pichler, Fang Wei