Author of the publication

Strong Backdoors for Default Logic.

, , and . SAT, volume 9710 of Lecture Notes in Computer Science, page 45-59. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

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