The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Reinhard Pichler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Georg Gottlob, Reinhard Pichler, Fang Wei
    Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Christian G. Fermüller, Reinhard Pichler
    Model Representation via Contexts and Implicit Generalizations. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:409-423 [Conf]
  3. Bernhard Gramlich, Reinhard Pichler
    Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:241-259 [Conf]
  4. Reinhard Pichler
    Solving Equational Problems Efficiently. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:97-111 [Conf]
  5. Reinhard Pichler
    On the Complexity of H-Subsumption. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:355-371 [Conf]
  6. Reinhard Pichler
    Extending Decidable Clause Classes via Constraints. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:206-220 [Conf]
  7. Reinhard Pichler
    Completeness and Redundancy in Constrained Clause Logic. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:221-235 [Conf]
  8. Georg Gottlob, Reinhard Pichler
    Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:708-719 [Conf]
  9. Reinhard Pichler
    Negation Elimination from Simple Equational Formulae. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:612-623 [Conf]
  10. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath Query Evaluation: Improving Time and Space Efficiency. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:379-390 [Conf]
  11. Miki Hermann, Reinhard Pichler
    Counting Complexity of Propositional Abduction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:417-422 [Conf]
  12. Christian G. Fermüller, Reinhard Pichler
    Model Representation over Finite and Infinite Signatures. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:164-176 [Conf]
  13. Reinhard Pichler
    Algorithms on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    JELIA, 1998, pp:199-215 [Conf]
  14. Georg Gottlob, Reinhard Pichler
    Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:306-315 [Conf]
  15. Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran
    Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:123-135 [Conf]
  16. Georg Gottlob, Christoph Koch, Reinhard Pichler
    The complexity of XPath query evaluation. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:179-190 [Conf]
  17. Georg Gottlob, Reinhard Pichler, Fang Wei
    Tractable database design through bounded treewidth. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:124-133 [Conf]
  18. Reinhard Pichler
    The Explicit Representability of Implicit Generalizations. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:187-202 [Conf]
  19. Georg Gottlob, Christoph Koch, Reinhard Pichler
    Efficient Algorithms for Processing XPath Queries. [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:95-106 [Conf]
  20. Reinhard Pichler
    Algorithmic Aspects of Model Representations. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:12-20 [Conf]
  21. Uwe Egly, Reinhard Pichler, Stefan Woltran
    On deciding subsumption problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:255-294 [Journal]
  22. Georg Gottlob, Reinhard Pichler
    Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:165, n:2, pp:183-207 [Journal]
  23. Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
    The complexity of XPath query evaluation and XML typing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:284-335 [Journal]
  24. Reinhard Pichler
    Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:2, pp:213-257 [Journal]
  25. Reinhard Pichler
    On the complexity of equational problems in CNF. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:235-269 [Journal]
  26. Georg Gottlob, Reinhard Pichler
    Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:351-378 [Journal]
  27. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath Processing in a Nutshell. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2003, v:32, n:1, pp:12-19 [Journal]
  28. Georg Gottlob, Christoph Koch, Reinhard Pichler
    XPath processing in a nutshell. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2003, v:32, n:2, pp:21-27 [Journal]
  29. Reinhard Pichler
    Explicit versus implicit representations of subsets of the Herbrand universe. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:1021-1056 [Journal]
  30. Georg Gottlob, Christoph Koch, Reinhard Pichler
    Efficient algorithms for processing XPath queries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:2, pp:444-491 [Journal]
  31. Georg Gottlob, Reinhard Pichler, Fang Wei
    Efficient Datalog Abduction through Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1626-1631 [Conf]
  32. Georg Gottlob, Reinhard Pichler, Fang Wei
    Monadic datalog over finite structures with bounded treewidth. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:165-174 [Conf]
  33. François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei
    Foundations of Rule-Based Query Answering. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2007, pp:1-153 [Conf]
  34. Christian G. Fermüller, Reinhard Pichler
    Model Representation over Finite and Infinite Signatures. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2007, v:17, n:3, pp:453-477 [Journal]

  35. Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. [Citation Graph (, )][DBLP]


  36. Multicut Algorithms via Tree Decompositions. [Citation Graph (, )][DBLP]


  37. Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP]


  38. The Complexity of Handling Minimal Solutions in Logic-Based Abduction. [Citation Graph (, )][DBLP]


  39. dRDF: Entailment for Domain-Restricted RDF. [Citation Graph (, )][DBLP]


  40. DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources . [Citation Graph (, )][DBLP]


  41. On Using Distributed Extended XQuery for Web Data Sources as Services. [Citation Graph (, )][DBLP]


  42. Answer-Set Programming with Bounded Treewidth. [Citation Graph (, )][DBLP]


  43. Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. [Citation Graph (, )][DBLP]


  44. A Dynamic-Programming Based ASP-Solver. [Citation Graph (, )][DBLP]


  45. Towards Fixed-Parameter Tractable Algorithms for Argumentation. [Citation Graph (, )][DBLP]


  46. Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. [Citation Graph (, )][DBLP]


  47. Fast Counting with Bounded Treewidth. [Citation Graph (, )][DBLP]


  48. Towards Practical Feasibility of Core Computation in Data Exchange. [Citation Graph (, )][DBLP]


  49. Belief Revision with Bounded Treewidth. [Citation Graph (, )][DBLP]


  50. Alternation as a programming paradigm. [Citation Graph (, )][DBLP]


  51. Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. [Citation Graph (, )][DBLP]


  52. Minimising RDF Graphs under Rules and Constraints Revisited. [Citation Graph (, )][DBLP]


  53. Bounded treewidth as a key to tractability of knowledge representation and reasoning. [Citation Graph (, )][DBLP]


  54. Monadic Datalog over Finite Structures with Bounded Treewidth [Citation Graph (, )][DBLP]


  55. Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.307secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002