CP-nets

swMATH1374MaRDI QIDQ14114FDOQ14114

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• An Efficient Procedure for Collective Decision-making with CP-nets
• Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets
• Title not available (Why is that?)
• MiniBrass: soft constraints for MiniZinc
• Solving satisfiability problems with preferences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modelling and learning user preferences over sets
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• Computing Utility from Weighted Description Logic Preference Formulas
• Conditional lexicographic orders in constraint satisfaction problems
• Preference-Based Inconsistency Assessment in Multi-Context Systems
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• The role of fuzzy sets in decision sciences: old techniques and new directions
• Three Scenarios for the Revision of Epistemic States
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Title not available (Why is that?)
• Nonmonotonic Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources
• Extreme points of the credal sets generated by comparative probabilities
• Preference change
• Eliciting Single-Peaked Preferences Using Comparison Queries
• Title not available (Why is that?)
• On the hardness of bribery variants in voting with CP-nets
• A New Solver for the Minimum Weighted Vertex Cover Problem
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• A distributed social choice protocol for combinatorial domains
• Comparing multiagent systems research in combinatorial auctions and voting
• Two alternatives for handling preferences in qualitative choice logic
• Extracting qualitative relations from categorical data
• Lexicographically-ordered constraint satisfaction problems
• Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• A postulate-based analysis of comparative preference statements
• Compactly representing utility functions using weighted goals and the Max aggregator
• Graph aggregation
• Sequential decision making with partially ordered preferences
• Profit-based latency problems on the line
• Kernel-based learning methods for preference aggregation
• Sequential composition of voting rules in multi-issue domains
• Voting almost maximizes social welfare despite limited communication
• A general framework for explaining the results of a multi-attribute preference model
• Database querying under changing preferences
• What will they say? -- Public announcement games
• Specifying and computing preferred plans
• A General Framework for Expressing Preferences in Causal Reasoning and Planning
• Enabling local computation for partially ordered preferences
• Hard and soft constraints for reasoning about qualitative conditional preferences
• The representation of conditional relative importance between criteria
• The local geometry of multiattribute tradeoff preferences
• Incentive-based search for equilibria in Boolean games
• Contracting preference relations for database applications
• Democratic approximation of lexicographic preference models
• Representing Utility Functions via Weighted Goals
• Logical formalisms for representing bipolar preferences
• On Computing Preferred MUSes and MCSes
• Title not available (Why is that?)
• Label ranking by learning pairwise preferences
• Autonomous agents modelling other agents: a comprehensive survey and open problems
• Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
• Mining top-\(k\) motifs with a SAT-based framework
• A logic of soft constraints based on partially ordered preferences
• Computational techniques for a simple theory of conditional preferences
• Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
• Combinatorial voter control in elections
• A Model of User-Oriented Reduct Construction for Machine Learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphically structured value-function compilation
• Bribery in voting with CP-nets
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Introducing Preferences in Planning as Satisfiability
• Expressive efficiency of two kinds of specific CP-nets
• Multi-context systems in dynamic environments
• Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
• Logic Programming
• Argumentation-Based Preference Modelling with Incomplete Information
• Axiomatic characterization of committee scoring rules
• Soft constraint problems with uncontrollable variables
• Title not available (Why is that?)
• Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
• Cubic preferences and the character admissibility problem
• Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
• Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
• CP-Nets, $$\pi $$-pref Nets, and Pareto Dominance
• Learning modulo theories for constructive preference elicitation
• Learning conditional preference networks
• A Snapshot on Reasoning with Qualitative Preference Statements in AI
• Making choices with a binary relation: relative choice axioms and transitive closures
• Multi resource allocation with partial preferences
• On database queries involving competitive conditional preferences
• A generic framework to include belief functions in preference handling and multi-criteria decision
• Editorial: Preference learning and ranking
• A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
• Relational networks of conditional preferences
• Scaling-invariant maximum margin preference learning
• Explaining robust additive utility models by sequences of preference swaps
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Pruning external minimality checking for answer set programs using semantic dependencies

This page was built for software: CP-nets