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
6342005
Efficient processing of XPath queries
G Gottlob, C Koch, R Pichler
US Patent 7,162,485, 2007
2032007
The complexity of XPath query evaluation
G Gottlob, C Koch, R Pichler
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003
1812003
Vinet: Visual-inertial odometry as a sequence-to-sequence learning problem
R Clark, S Wang, H Wen, A Markham, N Trigoni
Thirty-First AAAI Conference on Artificial Intelligence, 2017
1482017
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
1012013
XPath query evaluation: Improving time and space efficiency
G Gottlob, C Koch, R Pichler
Proceedings 19th International Conference on Data Engineering (Cat. No …, 2003
912003
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
842005
Bounded treewidth as a key to tractability of knowledge representation and reasoning
G Gottlob, R Pichler, F Wei
Artificial Intelligence 174 (1), 2010
712010
Towards fixed-parameter tractable algorithms for abstract argumentation
W Dvořák, R Pichler, S Woltran
Artificial Intelligence 186, 1-37, 2012
642012
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
582012
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
502010
Answer-set programming with bounded treewidth
M Jakl, R Pichler, S Woltran
Twenty-First International Joint Conference on Artificial Intelligence, 2009
482009
XPath processing in a nutshell
G Gottlob, C Koch, R Pichler
ACM SIGMOD Record 32 (1), 12-19, 2003
472003
Foundations of rule-based query answering
F Bry, N Eisinger, T Eiter, T Furche, G Gottlob, C Ley, B Linse, R Pichler, ...
Reasoning Web International Summer School, 1-153, 2007
432007
Containment and equivalence of well-designed SPARQL
R Pichler, S Skritek
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
422014
Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width
G Gottlob, R Pichler
SIAM Journal on Computing 33 (2), 351-378, 2004
402004
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
372018
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
362014
Tractable counting of the answers to conjunctive queries
R Pichler, S Skritek
Journal of Computer and System Sciences 79 (6), 984-1001, 2013
352013
Bounded treewidth as a key to tractability of knowledge representation and reasoning
G Gottlob, R Pichler, F Wei
AAAI 6, 250-256, 2006
322006
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20