141 citations · 303 across the 30 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014★ 5 cited
A Measure of Arbitrariness in Abductive Explanations
Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski +1
We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based…
cs.AI2014★ 141 cited
The Computational Complexity of Dominance and Consistency in CP-Nets
Judy Goldsmith, Jerome Lang, Miroslaw Truszczyski +1
We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in w…