Representing and Reasoning with Multi-Stakeholder Qualitative Preference Queries

Many decision-making scenarios, e.g., public policy, healthcare, business, and disaster response, require accommodating the preferences of multiple stakeholders. We offer the first formal treatment of reasoning with multi-stakeholder qualitative preferences in a setting where stakeholders express their preferences in a qualitative preference language, e.g., CP-net, CI-net, TCP-net, CP-Theory. We introduce a query language for expressing queries against such preferences over sets of outcomes that satisfy specified criteria, e.g., $\mlangpref{\psi_1}{\psi_2}{A}$ (read loosely as the set of outcomes satisfying $\psi_1$ that are preferred over outcomes satisfying $\psi_2$ by a set of stakeholders $A$). Motivated by practical application scenarios, we introduce and analyze several alternative semantics for such queries, and examine their interrelationships. We provide a provably correct algorithm for answering multi-stakeholder qualitative preference queries using model checking in alternation-free $\mu$-calculus. We present experimental results that demonstrate the feasibility of our approach.

[1]  J. Goldsmith,et al.  Reasoning with PCP-Nets , 2021, J. Artif. Intell. Res..

[2]  Athman Bouguettaya,et al.  A CP-Net Based Qualitative Composition Approach for an IaaS Provider , 2018, WISE.

[3]  Ganesh Ram Santhanam,et al.  Selecting the minimal set of preferred responses to counter detected intrusions , 2017, CISRC.

[4]  Piotr Jankowski,et al.  Geo‐questionnaire: A Method and Tool for Public Preference Elicitation in Land Use Planning , 2016, Trans. GIS.

[5]  Vasant Honavar,et al.  CRISNER: A Practically Efficient Reasoner for Qualitative Preferences , 2015, ArXiv.

[6]  Francesca Rossi,et al.  Reasoning with PCP-nets in a Multi-Agent Context , 2015, AAMAS.

[7]  Enrico Pontelli,et al.  A Non-monotonic Goal Specification Language for Planning with Preferences , 2014, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation.

[8]  Vasant Honavar,et al.  Model Checking of Qualitative Sensitivity Preferences to Minimize Credential Disclosure , 2012, FACS.

[9]  Ronen I. Brafman,et al.  On Graphical Modeling of Preference and Importance , 2011, J. Artif. Intell. Res..

[10]  Jorge A. Baier,et al.  Preferred Explanations: Theory and Generation via Planning , 2011, AAAI.

[11]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[12]  Eyke Hüllermeier,et al.  Preferences in AI: An overview , 2011, Artif. Intell..

[13]  David Scott Warren,et al.  XSB: Extending Prolog with Tabled Logic Programming , 2010, Theory and Practice of Logic Programming.

[14]  Sheila A. McIlraith,et al.  Preference-Based Web Service Composition: A Middle Ground between Execution and Search , 2010, SEMWEB.

[15]  John Mylopoulos,et al.  Integrating Preferences into Goal Models for Requirements Engineering , 2010, 2010 18th IEEE International Requirements Engineering Conference.

[16]  Vasant Honavar,et al.  Dominance Testing via Model Checking , 2010, AAAI.

[17]  Ulrich Endriss,et al.  Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods , 2009, IJCAI.

[18]  Ronen I. Brafman,et al.  Preference Handling - An Introductory Tutorial , 2009, AI Mag..

[19]  Irina Trubitsyna,et al.  Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario , 2007, CP.

[20]  Miroslaw Truszczynski,et al.  The computational complexity of dominance and consistency in CP-nets , 2005, IJCAI.

[21]  Nic Wilson,et al.  Extending CP-Nets with Stronger Conditional Preference Statements , 2004, AAAI.

[22]  Toby Walsh,et al.  mCP Nets: Representing and Reasoning with Preferences of Multiple Agents , 2004, AAAI.

[23]  Axel van Lamsweerde,et al.  Goal-Oriented Requirements Engineering: A Guided Tour , 2001, RE.

[24]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[25]  Jon Doyle,et al.  Background to Qualitative Decision Theory , 1999, AI Mag..

[26]  Patricia Flatley Brennan,et al.  Review: Improving Health Care by Understanding Patient Preferences: The Role of Computer Technology , 1998, J. Am. Medical Informatics Assoc..

[27]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[28]  S. French,et al.  Decision Theory: An Introduction to the Mathematics of Rationality. , 1988 .

[29]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[30]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[31]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[32]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[33]  Abdulaziz Alashaikh,et al.  Conditional Preference Networks for Cloud Service Selection and Ranking With Many Irrelevant Attributes , 2021, IEEE Access.

[34]  Y. Venema,et al.  A Focus System for the Alternation-Free μ-Calculus , 2021, TABLEAUX.

[35]  Toby Walsh,et al.  A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice , 2011, A Short Introduction to Preferences.

[36]  Marco Pistore,et al.  Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.

[37]  Stephan Merz,et al.  Model Checking , 2000 .

[38]  S. Hansson.  Changes in preference , 1995 .