Dominance Testing via Model Checking

Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar

AAAI 2010 pp. 357-362

doi:10.1609/AAAI.V24I1.7599 /aaai/2010/santhanam2010aaai-dominance/

Abstract

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.

PDF AAAI Semantic Scholar

Cite

Text

Santhanam et al. "Dominance Testing via Model Checking." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7599

Markdown

[Santhanam et al. "Dominance Testing via Model Checking." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/santhanam2010aaai-dominance/) doi:10.1609/AAAI.V24I1.7599

BibTeX

@inproceedings{santhanam2010aaai-dominance,
  title     = {{Dominance Testing via Model Checking}},
  author    = {Santhanam, Ganesh Ram and Basu, Samik and Honavar, Vasant G.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2010},
  pages     = {357-362},
  doi       = {10.1609/AAAI.V24I1.7599},
  url       = {https://mlanthology.org/aaai/2010/santhanam2010aaai-dominance/}
}