Person: Reinhard Pichler

DBLP: Pichler:Reinhard

Contributed to:

2015

2014

2012

2012

2012

2011

2011

2010

2009

2009

2009

2007

2006

2005

2003

2002

2002

2002

2001

2000

2000

1999

1999

1998

Wrote 28 papers:

PODS-2015-BarceloPS #approximate #evaluation #performance

Efficient Evaluation and Approximation of Well-designed Pattern Trees (PB, RP, SS), pp. 131–144.

PODS-2015-GottlobPS #dependence

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability (GG, RP, ES), pp. 65–77.

PODS-2014-KolaitisPSS #dependence #reasoning

Nested dependencies: structure and reasoning (PGK, RP, ES, VS), pp. 176–187.

PODS-2014-PichlerS #equivalence

Containment and equivalence of well-designed SPARQL (RP, SS), pp. 39–50.

KR-2012-CreignouPPW #logic

Belief Revision within Fragments of Propositional Logic (NC, OP, RP, SW).

PODS-2012-LetelierPPS #optimisation #query #semantics #static analysis #web

Static analysis and optimization of semantic web queries (AL, JP, RP, SS), pp. 89–100.

VLDB-2012-LetelierPPS #analysis #named

SPAM: A SPARQL Analysis and Manipulation Tool (AL, JP, RP, SS), pp. 1958–1961.

ICEIS-J-2011-AliPTD11a #query

Incorporating Data Concerns into Query Languages for Data Services (MIA, RP, HLT, SD), pp. 132–145.

ICEIS-v1-2011-AliPTD #integration #query

Data Concern Aware Querying for the Integration of Data Services (MIA, RP, HLT, SD), pp. 111–119.

KR-2010-DvorakPW #algorithm #parametricity #towards

Towards Fixed-Parameter Tractable Algorithms for Argumentation (WD, RP, SW).

KR-2010-PichlerRSW #bound #constraints #programming

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).

ICEIS-J-2009-AliPTD #data flow #distributed #framework #named #semistructured data #xquery

DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources (MIA, RP, HLT, SD), pp. 172–183.

PPDP-2009-DvorakGPW #paradigm #programming

Alternation as a programming paradigm (WD, GG, RP, SW), pp. 61–72.

VLDB-2009-GottlobPS #normalisation #optimisation

Normalization and Optimization of Schema Mappings (GG, RP, VS), pp. 1102–1113.

VLDB-2009-PichlerS #modelling #named

DEMo: Data Exchange Modeling Tool (RP, VS), pp. 1606–1609.

PODS-2007-GottlobPW #bound #datalog #finite #monad

Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.

PODS-2006-GottlobPW #bound #database #design

Tractable database design through bounded treewidth (GG, RP, FW), pp. 124–133.

CADE-2005-FermullerP #representation

Model Representation via Contexts and Implicit Generalizations (CGF, RP), pp. 409–423.

PODS-2003-GottlobKP #complexity #evaluation #query #xpath

The complexity of XPath query evaluation (GG, CK, RP), pp. 179–190.

CADE-2002-GramlichP #algorithm #aspect-oriented #equation #modelling

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations (BG, RP), pp. 241–259.

SAT-2002-EglyWP #on the #problem

On deciding subsumption problems (UE, SW, RP), p. 36.

VLDB-2002-GottlobKP #algorithm #performance #query #xpath

Efficient Algorithms for Processing XPath Queries (GG, CK, RP), pp. 95–106.

ICALP-2001-GottlobP #clique #model checking

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width (GG, RP), pp. 708–719.

ICALP-2000-Pichler #equation

Negation Elimination from Simple Equational Formulae (RP), pp. 612–623.

RTA-2000-Pichler

The Explicit Representability of Implicit Generalizations (RP), pp. 187–202.

CADE-1999-Pichler #equation #problem

Solving Equational Problems Efficiently (RP), pp. 97–111.

LICS-1999-GottlobP #complexity #modelling

Working with Arms: Complexity Results on Atomic Representations of Herbrand Models (GG, RP), pp. 306–315.

CSL-1998-Pichler #complexity #on the

On the Complexity of H-Subsumption (RP), pp. 355–371.