( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exploiting Treewidth for Projected Model Counting and its Limits.

, , , и . CoRR, (2018)

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.

Klaus Fichte

Erich Fichte

Alexander Fichte

Irene Fichte

Christa Fichte

 

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

Default Logic and Bounded Treewidth., , и . LATA, том 10792 из Lecture Notes in Computer Science, стр. 130-142. Springer, (2018)The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. CoRR, (2012)Default logic and bounded treewidth., , и . Inf. Comput., (2022)Dual-normal logic programs - the forgotten class., , и . Theory Pract. Log. Program., 15 (4-5): 495-510 (2015)Backdoors to the Tractability of Answer Set Programming.. Theory Pract. Log. Program., (2013)Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019., и . CoRR, (2019)Counting Complexity for Reasoning in Abstract Argumentation., , и . CoRR, (2018)Backdoor Trees for Answer Set Programming., и . ASPOCP@LPNMR, том 1868 из CEUR Workshop Proceedings, CEUR-WS.org, (2017)A Practical Account into Counting Dung's Extensions by Dynamic Programming., , , и . LPNMR, том 13416 из Lecture Notes in Computer Science, стр. 387-400. Springer, (2022)IASCAR: Incremental Answer Set Counting by Anytime Refinement., , , и . LPNMR, том 13416 из Lecture Notes in Computer Science, стр. 217-230. Springer, (2022)