RI: Small: Effective Preference Reasoning over Combinatorial Domains: Principles, Problems, Algorithms, and Implementations

This project aims to (1) establish a space of problems, principles and properties of qualitative reasoning about preferences over combinatorial domains, (2) design appropriate reasoning algorithms, and (3) demonstrate experimentally their practical effectiveness. The crucial characteristics of the project that make it novel and significant to artificial intelligence applications are synergistic connections to computational social choice theory, the focus on combinatorial domains, the treatment of incomplete preferences, and the use of declarative constraint modeling and solving formalisms such as answer-set programming, and propositional satisfiability as the uniform basis for a flexible, wide-scoped and effective computational platform for preference reasoning.