Följ
Reinhard Pichler
Reinhard Pichler
Verifierad e-postadress på dbai.tuwien.ac.at - Startsida
Titel
Citeras av
Citeras av
År
Efficient algorithms for processing XPath queries
G Gottlob, C Koch, R Pichler
ACM Transactions on Database Systems (TODS) 30 (2), 444-491, 2005
6602005
Efficient processing of XPath queries
G Gottlob, C Koch, R Pichler
US Patent 7,162,485, 2007
2232007
The complexity of XPath query evaluation
G Gottlob, C Koch, R Pichler
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003
1852003
Bounded treewidth as a key to tractability of knowledge representation and reasoning
G Gottlob, R Pichler, F Wei
Artificial Intelligence 174 (1), 105-132, 2010
1232010
Static analysis and optimization of semantic web queries
A Letelier, J Pérez, R Pichler, S Skritek
ACM Transactions on Database Systems (TODS) 38 (4), 1-45, 2013
1222013
The complexity of XPath query evaluation and XML typing
G Gottlob, C Koch, R Pichler, L Segoufin
Journal of the ACM (JACM) 52 (2), 284-335, 2005
962005
XPath query evaluation: Improving time and space efficiency
G Gottlob, C Koch, R Pichler
Proceedings 19th International Conference on Data Engineering (Cat. No …, 2003
942003
Towards fixed-parameter tractable algorithms for abstract argumentation
W Dvořák, R Pichler, S Woltran
Artificial Intelligence 186, 1-37, 2012
922012
Quality-aware service-oriented data integration: requirements, state of the art and open challenges
S Dustdar, R Pichler, V Savenkov, HL Truong
ACM SIGMOD Record 41 (1), 11-19, 2012
682012
Answer-Set Programming with Bounded Treewidth.
M Jakl, R Pichler, S Woltran
IJCAI 9, 816-822, 2009
662009
Tractable counting of the answers to conjunctive queries
R Pichler, S Skritek
Journal of Computer and System Sciences 79 (6), 984-1001, 2013
642013
Monadic datalog over finite structures of bounded treewidth
G Gottlob, R Pichler, F Wei
ACM Transactions on Computational Logic (TOCL) 12 (1), 1-48, 2010
582010
Containment and equivalence of well-designed SPARQL
R Pichler, S Skritek
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
572014
General and fractional hypertree decompositions: Hard and easy cases
W Fischl, G Gottlob, R Pichler
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
562018
Foundations of rule-based query answering
F Bry, N Eisinger, T Eiter, T Furche, G Gottlob, C Ley, B Linse, R Pichler, ...
Reasoning Web: Third International Summer School 2007, Dresden, Germany …, 2007
542007
XPath processing in a nutshell
G Gottlob, C Koch, R Pichler
ACM SIGMOD Record 32 (1), 12-19, 2003
522003
Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width
G Gottlob, R Pichler
SIAM Journal on Computing 33 (2), 351-378, 2004
502004
Belief revision within fragments of propositional logic
N Creignou, O Papini, R Pichler, S Woltran
Journal of Computer and System Sciences 80 (2), 427-449, 2014
492014
On the complexity of enumerating the extensions of abstract argumentation frameworks
M Kröll, R Pichler, S Woltran
Proceedings of the 26th International Joint Conference on Artificial …, 2017
442017
Capturing relational schemas and functional dependencies in RDFS
D Calvanese, W Fischl, R Pichler, E Sallinger, M Simkus
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
442014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20