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 publicationProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
PublisherAAAI press
Pages357-362
Number of pages6
ISBN (Electronic)9781577354642
StatePublished - Jul 15 2010
Event24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States
Duration: Jul 11 2010Jul 15 2010

Publication series

NameProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Conference

Conference24th AAAI Conference on Artificial Intelligence, AAAI 2010
Country/TerritoryUnited States
CityAtlanta
Period7/11/107/15/10

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Dominance Testing Via Model Checking'. Together they form a unique fingerprint.

Cite this