Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDReinhard Pichler
Person information
- affiliation: TU Wien, Vienna, Autria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j40]Reinhard Pichler:
Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. SIGMOD Rec. 49(1): 51 (2020)- [j39]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
On the Language of Nested Tuple Generating Dependencies. ACM Trans. Database Syst. 45(2): 8:1-8:59 (2020) - [c100]Georg Gottlob, Matthias Lanzinger
, Davide Mario Longo, Cem Okulmus, Reinhard Pichler:
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CPAIOR 2020: 3-21 - [c99]Georg Gottlob, Cem Okulmus, Reinhard Pichler:
Fast and Parallel Decomposition of Constraint Satisfaction Problems. IJCAI 2020: 1155-1162 - [c98]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI 2020: 1726-1733 - [c97]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS 2020: 41:1-41:14 - [i14]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR abs/2002.05239 (2020) - [i13]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR abs/2007.01830 (2020) - [i12]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR abs/2007.14169 (2020) - [i11]Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. CoRR abs/2009.01769 (2020)
2010 – 2019
- 2019
- [j38]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268: 191-209 (2019) - [c96]Wolfgang Fischl, Georg Gottlob, Davide M. Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. AMW 2019 - [c95]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width Revisited (Extended Abstract). AMW 2019 - [c94]Georg Gottlob, Cem Okulmus, Reinhard Pichler:
Parallel Computation of Generalized Hypertree Decompositions. AMW 2019 - [c93]Leopoldo E. Bertossi, Georg Gottlob, Reinhard Pichler:
Datalog: Bag Semantics via Set Semantics. ICDT 2019: 16:1-16:19 - [c92]Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. PODS 2019: 464-480 - [i10]Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt:
Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports 9(5): 89-109 (2019) - 2018
- [j37]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Log. Methods Comput. Sci. 14(4) (2018) - [j36]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. Theory Comput. Syst. 62(4): 899-940 (2018) - [j35]Pablo Barceló, Markus Kröll, Reinhard Pichler, Sebastian Skritek:
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. ACM Trans. Database Syst. 43(2): 8:1-8:44 (2018) - [c91]Wolfgang Fischl, Georg Gottlob, Reinhard Pichler:
General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). AMW 2018 - [c90]Theresa Csar, Martin Lackner, Reinhard Pichler:
Computing the Schulze Method for Large-Scale Preference Data Sets. IJCAI 2018: 180-187 - [c89]Wolfgang Fischl, Georg Gottlob, Reinhard Pichler:
General and Fractional Hypertree Decompositions: Hard and Easy Cases. PODS 2018: 17-32 - [e3]Michael H. Böhlen, Reinhard Pichler, Norman May, Erhard Rahm, Shan-Hung Wu, Katja Hose:
Proceedings of the 21st International Conference on Extending Database Technology, EDBT 2018, Vienna, Austria, March 26-29, 2018. OpenProceedings.org 2018, ISBN 978-3-89318-078-3 [contents] - [i9]Leopoldo E. Bertossi, Georg Gottlob, Reinhard Pichler:
Datalog: Bag Semantics via Set Semantics. CoRR abs/1803.06445 (2018) - [i8]Wolfgang Fischl, Georg Gottlob, Davide M. Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. CoRR abs/1811.08181 (2018) - [i7]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. CoRR abs/1812.04329 (2018) - 2017
- [j34]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Implementing Courcelle's Theorem in a declarative framework for dynamic programming. J. Log. Comput. 27(4): 1067-1094 (2017) - [c88]Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger:
Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 - [c87]Georg Gottlob, Reinhard Pichler, Emanuel Sallinger:
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. AMW 2017 - [c86]Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger:
Computational Social Choice in the Clouds. BTW (Workshops) 2017: 163-167 - [c85]Markus Kröll, Reinhard Pichler, Stefan Woltran:
On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. IJCAI 2017: 1145-1152 - [c84]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195 - [i6]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? CoRR abs/1711.07786 (2017) - 2016
- [j33]Kathrin Conrad, Nysret Musliu, Reinhard Pichler, Hannes Werthner:
Universities and computer science in the European crisis of refugees. Commun. ACM 59(10): 31-33 (2016) - [j32]Jesús Medina, Reinhard Pichler:
Fuzzy data exchange. Fuzzy Sets Syst. 301: 129-145 (2016) - [c83]Markus Kröll, Reinhard Pichler, Sebastian Skritek:
On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees. AMW 2016 - [c82]Shqiponja Ahmetaj, Wolfgang Fischl, Markus Kröll, Reinhard Pichler, Mantas Simkus, Sebastian Skritek:
The Challenge of Optional Matching in SPARQL. FoIKS 2016: 169-190 - [c81]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. ICDT 2016: 19:1-19:17 - [c80]Sebastian Arming, Reinhard Pichler, Emanuel Sallinger:
Complexity of Repair Checking and Consistent Query Answering. ICDT 2016: 21:1-21:18 - [c79]Markus Kröll, Reinhard Pichler, Sebastian Skritek:
On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. ICDT 2016: 22:1-22:18 - [e2]Reinhard Pichler, Altigran Soares da Silva:
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016. CEUR Workshop Proceedings 1644, CEUR-WS.org 2016 [contents] - [i5]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. CoRR abs/1610.05493 (2016) - [i4]Wolfgang Fischl, Georg Gottlob, Reinhard Pichler:
General and Fractional Hypertree Decompositions: Hard and Easy Cases. CoRR abs/1611.01090 (2016) - 2015
- [j31]Ingo Feinerer, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
On the undecidability of the equivalence of second-order tuple generating dependencies. Inf. Syst. 48: 113-129 (2015) - [j30]Andreas Pfandler, Reinhard Pichler, Stefan Woltran:
The complexity of handling minimal solutions in logic-based abduction. J. Log. Comput. 25(3): 805-825 (2015) - [c78]Shqiponja Ahmetaj, Wolfgang Fischl, Reinhard Pichler, Mantas Simkus, Sebastian Skritek:
Towards Reconciling SPARQL and Certain Answers (Extended Abstract). AMW 2015 - [c77]Pablo Barceló, Reinhard Pichler, Sebastian Skritek:
Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). AMW 2015 - [c76]Theresa Csar, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Using Statistics for Computing Joins with MapReduce. AMW 2015 - [c75]Shqiponja Ahmetaj, Wolfgang Fischl, Reinhard Pichler, Mantas Simkus, Sebastian Skritek:
DL-Lite and Conjunctive Queries Extended by Optional Matching. Description Logics 2015 - [c74]Georg Gottlob, Reinhard Pichler, Emanuel Sallinger:
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. PODS 2015: 65-77 - [c73]Pablo Barceló, Reinhard Pichler, Sebastian Skritek:
Efficient Evaluation and Approximation of Well-designed Pattern Trees. PODS 2015: 131-144 - [c72]Shqiponja Ahmetaj, Wolfgang Fischl, Reinhard Pichler, Mantas Simkus, Sebastian Skritek:
Towards Reconciling SPARQL and Certain Answers. WWW 2015: 23-33 - 2014
- [j29]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief revision within fragments of propositional logic. J. Comput. Syst. Sci. 80(2): 427-449 (2014) - [j28]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14(2): 141-164 (2014) - [c71]Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, Mantas Simkus:
Capturing Relational Schemas and Functional Dependencies in RDFS. AAAI 2014: 1003-1011 - [c70]Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler:
A Parameterized Complexity Analysis of Generalized CP-Nets. AAAI 2014: 1091-1097 - [c69]Sebastian Arming, Reinhard Pichler, Emanuel Sallinger:
Combined Complexity of Repair Checking and Consistent Query Answering. AMW 2014 - [c68]Reinhard Pichler, Sebastian Skritek:
On the Hardness of Counting the Solutions of SPARQL Queries. AMW 2014 - [c67]Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, Mantas Simkus:
Expressive Identification Constraints to Capture Functional Dependencies in Description Logics. Description Logics 2014: 416-420 - [c66]Jesús Medina, Reinhard Pichler:
A Fuzzy Extension of Data Exchange. IPMU (2) 2014: 214-223 - [c65]Reinhard Pichler, Sebastian Skritek:
Containment and equivalence of well-designed SPARQL. PODS 2014: 39-50 - [c64]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Nested dependencies: structure and reasoning. PODS 2014: 176-187 - 2013
- [j27]Reinhard Pichler, Sebastian Skritek:
Tractable counting of the answers to conjunctive queries. J. Comput. Syst. Sci. 79(6): 984-1001 (2013) - [j26]Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Relaxed Notions of Schema Mapping Equivalence Revisited. Theory Comput. Syst. 52(3): 483-541 (2013) - [j25]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web 4(4): 351-393 (2013) - [j24]Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek:
Static analysis and optimization of semantic web queries. ACM Trans. Database Syst. 38(4): 25:1-25:45 (2013) - [c63]Paolo Guagliardo, Reinhard Pichler, Emanuel Sallinger:
Enhancing the Updatability of Projective Views. AMW 2013 - [c62]Andreas Hubmer, Reinhard Pichler, Vadim Savenkov, Sebastian Skritek:
Efficient Updates of Uncertain Databases. AMW 2013 - [c61]Vadim Savenkov, Reinhard Pichler, Christoph Koch:
Loop Elimination for Database Updates. BNCOD 2013: 48-61 - [c60]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI 2013: 824-831 - [c59]Martin Kronegger, Andreas Pfandler, Reinhard Pichler:
Parameterized Complexity of Optimal Planning: A Detailed Map. IJCAI 2013: 954-961 - [c58]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. IPEC 2013: 28-40 - 2012
- [j23]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran:
Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186: 1-37 (2012) - [j22]Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek:
SPAM: A SPARQL Analysis and Manipulation Tool. Proc. VLDB Endow. 5(12): 1958-1961 (2012) - [j21]Schahram Dustdar, Reinhard Pichler, Vadim Savenkov, Hong Linh Truong:
Quality-aware service-oriented data integration: requirements, state of the art and open challenges. SIGMOD Rec. 41(1): 11-19 (2012) - [c57]Jorge Pérez, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Union and Intersection of Schema Mappings. AMW 2012: 129-141 - [c56]Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126 - [c55]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief Revision within Fragments of Propositional Logic. KR 2012 - [c54]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144 - [c53]Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek:
Static analysis and optimization of semantic web queries. PODS 2012: 89-100 - [e1]Pablo Barceló, Reinhard Pichler:
Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Vienna, Austria, September 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7494, Springer 2012, ISBN 978-3-642-32924-1 [contents] - [i3]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012) - 2011
- [j20]Georg Gottlob, Reinhard Pichler, Vadim Savenkov:
Normalization and optimization of schema mappings. VLDB J. 20(2): 277-302 (2011) - [c52]Ingo Feinerer, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies. AMW 2011 - [c51]Reinhard Pichler, Sebastian Skritek:
Tractable Counting of the Answers to Conjunctive Queries. AMW 2011 - [c50]Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar:
On Integrating Data Services Using Data Mashups. BNCOD 2011: 132-135 - [c49]Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Relaxed notions of schema mapping equivalence revisited. ICDT 2011: 90-101 - [c48]Reinhard Pichler, Sebastian Skritek:
The complexity of evaluating tuple generating dependencies. ICDT 2011: 244-255 - [c47]Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar:
Data Concern Aware Querying for the Integration of Data Services. ICEIS (1) 2011: 111-119 - [c46]Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar:
Incorporating Data Concerns into Query Languages for Data Services. ICEIS 2011: 132-145 - [c45]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918 - 2010
- [j19]Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell. 174(1): 105-132 (2010) - [j18]Georg Gottlob, Reinhard Pichler, Fang Wei:
Tractable database design and datalog abduction through bounded treewidth. Inf. Syst. 35(3): 278-298 (2010) - [j17]Miki Hermann, Reinhard Pichler:
Counting complexity of propositional abduction. J. Comput. Syst. Sci. 76(7): 634-649 (2010) - [j16]Reinhard Pichler, Vadim Savenkov:
Towards practical feasibility of core computation in data exchange. Theor. Comput. Sci. 411(7-9): 935-957 (2010) - [j15]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures of bounded treewidth. ACM Trans. Comput. Log. 12(1): 3:1-3:48 (2010) - [c44]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Minimising RDF Graphs under Rules and Constraints Revisited. AMW 2010 - [c43]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut Algorithms via Tree Decompositions. CIAC 2010: 167-179 - [c42]Reinhard Pichler:
Exploiting Bounded Treewidth with Datalog (A Survey). Datalog 2010: 88-105 - [c41]Reinhard Pichler, Stefan Woltran:
The Complexity of Handling Minimal Solutions in Logic-Based Abduction. ECAI 2010: 895-900 - [c40]Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372 - [c39]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran:
Towards Fixed-Parameter Tractable Algorithms for Argumentation. KR 2010 - [c38]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010 - [c37]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404 - [c36]Reinhard Pichler, Vadim Savenkov, Sebastian Skritek, Hong Linh Truong:
Uncertain Databases in Collaborative Data Management. MUD 2010: 129-143 - [c35]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. RR 2010: 133-148
2000 – 2009
- 2009
- [j14]Georg Gottlob, Reinhard Pichler, Vadim Savenkov:
Normalization and Optimization of Schema Mappings. Proc. VLDB Endow. 2(1): 1102-1113 (2009) - [j13]Reinhard Pichler, Vadim Savenkov:
DEMo: Data Exchange Modeling Tool. Proc. VLDB Endow. 2(2): 1606-1609 (2009) - [j12]Miki Hermann, Reinhard Pichler:
Complexity of counting the optimal solutions. Theor. Comput. Sci. 410(38-40): 3814-3825 (2009) - [c34]Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar:
DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources . ICEIS 2009: 172-183 - [c33]Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar:
On Using Distributed Extended XQuery for Web Data Sources as Services. ICWE 2009: 497-500 - [c32]Michael Jakl, Reinhard Pichler, Stefan Woltran:
Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822 - [c31]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263 - [c30]Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran:
Alternation as a programming paradigm. PPDP 2009: 61-72 - 2008
- [c29]Georg Gottlob, Reinhard Pichler, Fang Wei:
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. AAAI 2008: 1541-1546 - [c28]Miki Hermann, Reinhard Pichler:
Complexity of Counting the Optimal Solutions. COCOON 2008: 149-159 - [c27]Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran:
dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214 - [c26]Miki Hermann, Reinhard Pichler:
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218 - [c25]Reinhard Pichler, Vadim Savenkov:
Towards Practical Feasibility of Core Computation in Data Exchange. LPAR 2008: 62-78 - [c24]Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Fast Counting with Bounded Treewidth. LPAR 2008: 436-450 - [i2]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic Datalog over Finite Structures with Bounded Treewidth. CoRR abs/0809.3140 (2008) - [i1]Miki Hermann, Reinhard Pichler:
Complexity of Counting the Optimal Solutions. Electron. Colloquium Comput. Complex. 15(044) (2008) - 2007
- [j11]Christian G. Fermüller, Reinhard Pichler:
Model Representation over Finite and Infinite Signatures. J. Log. Comput. 17(3): 453-477 (2007) - [c23]Georg Gottlob, Reinhard Pichler, Fang Wei:
Efficient Datalog Abduction through Bounded Treewidth. AAAI 2007: 1626-1631 - [c22]Miki Hermann, Reinhard Pichler:
Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422 - [c21]Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran:
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135 - [c20]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures with bounded treewidth. PODS 2007: 165-174 - [c19]