79 citations · 126 across the 29 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016★ 2 cited
Counting Answer Sets via Dynamic Programming
Johannes Fichte, Markus Hecher, Michael Morak +1
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving pa…
cs.LO2016
Strong Backdoors for Default Logic
Johannes K. Fichte, Arne Meier, Irina Schindler
In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection…