Logical preference representation and combinatorial vote
From MaRDI portal
Publication:702101
DOI10.1023/B:AMAI.0000034522.25580.09zbMath1061.68147MaRDI QIDQ702101
Publication date: 17 January 2005
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:amai.0000034522.25580.09
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Voting Procedures, Complexity of, Twenty-Five Years of Preferred Subtheories, ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING, Preferences in artificial intelligence, Non-exclusive hypotheses in Dempster-Shafer theory, Graph aggregation, A distributed social choice protocol for combinatorial domains, Expressive efficiency of two kinds of specific CP-nets, Compactly representing utility functions using weighted goals and the Max aggregator, Computational techniques for a simple theory of conditional preferences, Incompleteness and incomparability in preference aggregation: complexity results, Sequential composition of voting rules in multi-issue domains, Representing interval orders by weighted bases: some complexity results, Propositional distances and compact preference representation, Choice logics and their computational properties, Computing a small agreeable set of indivisible items, Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting, Graphically structured value-function compilation, Lifting integrity constraints in binary aggregation, Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting, Representing Utility Functions via Weighted Goals, Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities, Voting in Combinatorial Domains: What Logic and AI Have to Say, Using Logic to Understand Relations between DSmT and Dempster-Shafer Theory
