CP-nets
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Comparing the notions of optimality in CP-nets, strategic games and soft constraints
- Kernel-based learning methods for preference aggregation
- Sequential composition of voting rules in multi-issue domains
- Representing interval orders by weighted bases: some complexity results
- DARN!
- AFRA
- SOFT
- Autonomous agents modelling other agents: a comprehensive survey and open problems
- A generic framework to include belief functions in preference handling and multi-criteria decision
- CP- and OCF-networks -- a comparison
- Axiomatic characterization of committee scoring rules
- kappalab
- DARCLASS
- Dealing with explicit preferences and uncertainty in answer set programming
- NumberJack
- Relational networks of conditional preferences
- PrefLib
- Incentive-based search for equilibria in Boolean games
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- Pruning external minimality checking for answer set programs using semantic dependencies
- LERS
- Preference-based inconsistency-tolerant query answering under existential rules
- DMCS
- Incremental evaluation of continuous preference queries
- Possibilistic preference networks
- Learning modulo theories for constructive preference elicitation
- Editorial: Preference learning and ranking
- Lexicographically-ordered constraint satisfaction problems
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- Multi-context systems in dynamic environments
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- MiniBrass: soft constraints for MiniZinc
- Cubic preferences and the character admissibility problem
- Combinatorial voter control in elections
- Extreme points of the credal sets generated by comparative probabilities
- Erratum to: ``Database preference queries -- a possibilistic logic approach with symbolic priorities
- Explaining robust additive utility models by sequences of preference swaps
- Database querying under changing preferences
- Graphically structured value-function compilation
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Label ranking by learning pairwise preferences
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- A reward-based approach for preference modeling: a case study
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
- Bribery in voting with CP-nets
- The representation of conditional relative importance between criteria
- A logic of soft constraints based on partially ordered preferences
- Hard and soft constraints for reasoning about qualitative conditional preferences
- Integration and propagation of a multi-criteria decision making model in constraint programming
- Inferring latent class lexicographic rules from choice data
- Decision-making with Sugeno integrals. Bridging the gap between multicriteria evaluation and decision under uncertainty
- Snort
- BioWar
- Scaling-invariant maximum margin preference learning
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Multi resource allocation with partial preferences
- Aggregating preferences represented by conditional preference networks
- Probabilistic lexicographic preference trees
- M-MACBETH
- VisualUTA
- A new solver for the minimum weighted vertex cover problem
- Nested preferences in answer set programming
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- An efficient procedure for collective decision-making with CP-nets
- Nonmonotonic multi-context systems: a flexible approach for integrating heterogeneous knowledge sources
- Introducing preferences in planning as satisfiability
- On database queries involving competitive conditional preferences
- Preference change
- CircuitTSAT
- Argumentation-based preference modelling with incomplete information
- Learning ordinal preferences on multiattribute domains: the case of CP-nets
- Soft constraint problems with uncontrollable variables
- scientific article; zbMATH DE number 5842485 (Why is no real title available?)
- aspcud
- Preference SQL
- Representing and reasoning with qualitative preferences for compositional systems
- On the hardness of bribery variants in voting with CP-nets
- A model based on outranking for database preference queries
- Planning as satisfiability with IPC simple preferences and action costs
- On computing preferred MUSes and MCSes
- Extracting qualitative relations from categorical data
- Yochan
- PPlan
- GRAPPA
- CP-nets, -pref nets, and Pareto dominance
- Probabilistic TCP-net
- Carneades
- Representing Utility Functions via Weighted Goals
- Computing Utility from Weighted Description Logic Preference Formulas
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
- Logical formalisms for representing bipolar preferences
- Three Scenarios for the Revision of Epistemic States
- Voting in Combinatorial Domains: What Logic and AI Have to Say
- A flexible model for the evaluation of soft conditional preferences in fuzzy databases
- Combining totalitarian and Ceteris Paribus semantics in database preference queries
- Modelling and learning user preferences over sets
- A Model of User-Oriented Reduct Construction for Machine Learning
- On graphical modeling of preference and importance
This page was built for software: CP-nets
