Sciweavers

Share
AAAI
2010

Dominance Testing via Model Checking

9 years 2 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithms and tools for dominance testing. CP-nets and TCP-nets are some of the widely studied languages for representing and reasoning with preferences. We reduce dominance testing in TCP-nets to reachability analysis in a graph of outcomes. We provide an encoding of TCP-nets in the form of a Kripke structure for CTL. We show how to compute dominance using NuSMV, a model checker for CTL. We present results of experiments that demonstrate the feasibility of our approach to dominance testing.
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where AAAI
Authors Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
Comments (0)
books