Verifying Preferential Equivalence and Subsumption via Model Checking

Ganesh Ram Santhanam; Samik Basu; Vasant Honavar

doi:10.1007/978-3-642-41575-3_25

Verifying Preferential Equivalence and Subsumption via Model Checking

Ganesh Ram Santhanam, Samik Basu, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

We present a practical, model checking based, approach to verifying whether a set of ceteris paribus preference statements is equivalent to or is subsumed by another. We translate a given pair of sets of preference statements into a labeled transition system (LTS) and reduce the problem of determining whether one set of preference statements is equivalent to or is subsumed by the other to verifying the appropriate computation-tree temporal logic (CTL) formulas in the resulting LTS. Whenever the two sets of preference statements are not equivalent, our method outputs a dominance relationship that is induced by one and not by the other. Our approach is applicable to all preference languages based on ceteris paribus semantics including CP-nets, TCP-nets, CI-nets and CP-Theories.

Original language	English (US)
Title of host publication	Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings
Publisher	Springer Verlag
Pages	324-335
Number of pages	12
ISBN (Print)	9783642415746
DOIs	https://doi.org/10.1007/978-3-642-41575-3_25
State	Published - 2013
Event	3rd International Conference on Algorithmic Decision Theory, ADT 2013 - Bruxelles, Belgium Duration: Nov 13 2013 → Nov 15 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8176 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Conference on Algorithmic Decision Theory, ADT 2013
Country	Belgium
City	Bruxelles
Period	11/13/13 → 11/15/13

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-41575-3_25

Fingerprint Dive into the research topics of 'Verifying Preferential Equivalence and Subsumption via Model Checking'. Together they form a unique fingerprint.

Cite this

Santhanam, G. R., Basu, S., & Honavar, V. (2013). Verifying Preferential Equivalence and Subsumption via Model Checking. In Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings (pp. 324-335). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8176 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-642-41575-3_25

Santhanam, Ganesh Ram ; Basu, Samik ; Honavar, Vasant. / Verifying Preferential Equivalence and Subsumption via Model Checking. Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Springer Verlag, 2013. pp. 324-335 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6be3ab281e41463a9e7cf1c7f454db16,

title = "Verifying Preferential Equivalence and Subsumption via Model Checking",

abstract = "We present a practical, model checking based, approach to verifying whether a set of ceteris paribus preference statements is equivalent to or is subsumed by another. We translate a given pair of sets of preference statements into a labeled transition system (LTS) and reduce the problem of determining whether one set of preference statements is equivalent to or is subsumed by the other to verifying the appropriate computation-tree temporal logic (CTL) formulas in the resulting LTS. Whenever the two sets of preference statements are not equivalent, our method outputs a dominance relationship that is induced by one and not by the other. Our approach is applicable to all preference languages based on ceteris paribus semantics including CP-nets, TCP-nets, CI-nets and CP-Theories.",

author = "Santhanam, {Ganesh Ram} and Samik Basu and Vasant Honavar",

year = "2013",

doi = "10.1007/978-3-642-41575-3_25",

language = "English (US)",

isbn = "9783642415746",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "324--335",

booktitle = "Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings",

address = "Germany",

}

Santhanam, GR, Basu, S & Honavar, V 2013, Verifying Preferential Equivalence and Subsumption via Model Checking. in Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8176 LNAI, Springer Verlag, pp. 324-335, 3rd International Conference on Algorithmic Decision Theory, ADT 2013, Bruxelles, Belgium, 11/13/13. https://doi.org/10.1007/978-3-642-41575-3_25

Verifying Preferential Equivalence and Subsumption via Model Checking. / Santhanam, Ganesh Ram; Basu, Samik; Honavar, Vasant.

Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Springer Verlag, 2013. p. 324-335 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8176 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Verifying Preferential Equivalence and Subsumption via Model Checking

AU - Santhanam, Ganesh Ram

AU - Basu, Samik

AU - Honavar, Vasant

PY - 2013

Y1 - 2013

N2 - We present a practical, model checking based, approach to verifying whether a set of ceteris paribus preference statements is equivalent to or is subsumed by another. We translate a given pair of sets of preference statements into a labeled transition system (LTS) and reduce the problem of determining whether one set of preference statements is equivalent to or is subsumed by the other to verifying the appropriate computation-tree temporal logic (CTL) formulas in the resulting LTS. Whenever the two sets of preference statements are not equivalent, our method outputs a dominance relationship that is induced by one and not by the other. Our approach is applicable to all preference languages based on ceteris paribus semantics including CP-nets, TCP-nets, CI-nets and CP-Theories.

AB - We present a practical, model checking based, approach to verifying whether a set of ceteris paribus preference statements is equivalent to or is subsumed by another. We translate a given pair of sets of preference statements into a labeled transition system (LTS) and reduce the problem of determining whether one set of preference statements is equivalent to or is subsumed by the other to verifying the appropriate computation-tree temporal logic (CTL) formulas in the resulting LTS. Whenever the two sets of preference statements are not equivalent, our method outputs a dominance relationship that is induced by one and not by the other. Our approach is applicable to all preference languages based on ceteris paribus semantics including CP-nets, TCP-nets, CI-nets and CP-Theories.

UR - http://www.scopus.com/inward/record.url?scp=84890020242&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890020242&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-41575-3_25

DO - 10.1007/978-3-642-41575-3_25

M3 - Conference contribution

AN - SCOPUS:84890020242

SN - 9783642415746

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 324

EP - 335

BT - Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings

PB - Springer Verlag

T2 - 3rd International Conference on Algorithmic Decision Theory, ADT 2013

Y2 - 13 November 2013 through 15 November 2013

ER -

Santhanam GR, Basu S, Honavar V. Verifying Preferential Equivalence and Subsumption via Model Checking. In Algorithmic Decision Theory - Third International Conference, ADT 2013, Proceedings. Springer Verlag. 2013. p. 324-335. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-41575-3_25

Verifying Preferential Equivalence and Subsumption via Model Checking

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this