( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.

, , , , и . LION, том 7219 из Lecture Notes in Computer Science, стр. 130-144. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Reinhard Pichler

Otto Pichler

Annemarie Pichler

Garwin Pichler

Ilse Pichler

 

Другие публикации лиц с тем же именем

Multicut Algorithms via Tree Decompositions., , и . CIAC, том 6078 из Lecture Notes in Computer Science, стр. 167-179. Springer, (2010)Solving Equational Problems Efficiently.. CADE, том 1632 из Lecture Notes in Computer Science, стр. 97-111. Springer, (1999)Complexity Analysis of General and Fractional Hypertree Decompositions., , , и . CoRR, (2020)The complexity of XPath query evaluation., , и . PODS, стр. 179-190. ACM, (2003)Containment and equivalence of well-designed SPARQL., и . PODS, стр. 39-50. ACM, (2014)Fractional Covers of Hypergraphs with Bounded Multi-Intersection., , , и . MFCS, том 170 из LIPIcs, стр. 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Towards Reconciling SPARQL and Certain Answers., , , , и . WWW, стр. 23-33. ACM, (2015)Belief Revision within Fragments of Propositional Logic., , , и . KR, AAAI Press, (2012)HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings., , , и . AMW, том 2369 из CEUR Workshop Proceedings, CEUR-WS.org, (2019)On the Complexity of Enumerating the Answers to Well-designed Pattern Trees., , и . ICDT, том 48 из LIPIcs, стр. 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)