Dominance testing via model checking

Ganesh Ram Santhanam, Samik Basu, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAAAI-10 / IAAI-10 - Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference
PublisherAI Access Foundation
Pages357-362
Number of pages6
ISBN (Print)9781577354642
StatePublished - Jan 1 2010
Event24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10 - Atlanta, GA, United States
Duration: Jul 11 2010Jul 15 2010

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume1

Other

Other24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10
CountryUnited States
CityAtlanta, GA
Period7/11/107/15/10

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Dominance testing via model checking'. Together they form a unique fingerprint.

Cite this