3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.AI2013
Uncertainty and Incompleteness
Piero P. Bonissone, David A. Cyrluk, James W. Goodwin +1
Two major difficulties in using default logics are their intractability and the problem of selecting among multiple extensions. We propose an approach to these problems based on in…
cs.AI2013★ 3 cited
On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks
Jonathan Stillman
We introduce a new heuristic algorithm for the problem of finding minimum size loop cutsets in multiply connected belief networks. We compare this algorithm to that proposed in [Su…