CP-nets
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Eliciting single-peaked preferences using comparison queries
- Multi-context systems in dynamic environments
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Logic Programming
- Nonmonotonic multi-context systems: a flexible approach for integrating heterogeneous knowledge sources
- MiniBrass: soft constraints for MiniZinc
- Solving satisfiability problems with preferences
- Axiomatic characterization of committee scoring rules
- Łukasiewicz games: a logic-based approach to quantitative strategic interactions
- Soft constraint problems with uncontrollable variables
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- On the semantics of logic programs with preferences
- Cubic preferences and the character admissibility problem
- An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Modelling and learning user preferences over sets
- Computing Utility from Weighted Description Logic Preference Formulas
- Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
- Conditional lexicographic orders in constraint satisfaction problems
- Interactive exploration of multi-dimensional and hierarchical information spaces with real-time preference elicitation
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
- Preference-Based Inconsistency Assessment in Multi-Context Systems
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- Database preference queries -- a possibilistic logic approach with symbolic priorities
- The role of fuzzy sets in decision sciences: old techniques and new directions
- A new solver for the minimum weighted vertex cover problem
- On graphical modeling of preference and importance
- The computational complexity of dominance and consistency in CP-nets
- Representing and reasoning with qualitative preferences for compositional systems
- Three Scenarios for the Revision of Epistemic States
- Learning conditional preference networks
- Learning modulo theories for constructive preference elicitation
- A model based on outranking for database preference queries
- Making choices with a binary relation: relative choice axioms and transitive closures
- Multi resource allocation with partial preferences
- A Snapshot on Reasoning with Qualitative Preference Statements in AI
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- On database queries involving competitive conditional preferences
- Extreme points of the credal sets generated by comparative probabilities
- Preference change
- A generic framework to include belief functions in preference handling and multi-criteria decision
- On the qualitative comparison of decisions having positive and negative features
- Editorial: Preference learning and ranking
- scientific article; zbMATH DE number 5842485 (Why is no real title available?)
- A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
- On the hardness of bribery variants in voting with CP-nets
- New islands of tractability of cost-optimal planning
- Generic preferences over subsets of structured objects
- The complexity of planning problems with simple causal graphs
- On computing preferred MUSes and MCSes
- A distributed social choice protocol for combinatorial domains
- Comparing multiagent systems research in combinatorial auctions and voting
- Relational networks of conditional preferences
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- DARN!
- AFRA
- SOFT
- kappalab
- DARCLASS
- NumberJack
- Meta-heuristic and constraint-based approaches for single-line railway timetabling
- PrefLib
- LERS
- DMCS
- Snort
- BioWar
- M-MACBETH
- VisualUTA
- GRAPPA
- CircuitTSAT
- aspcud
- Preference SQL
- PPlan
- Yochan
- Carneades
- MiniBrass
- fast-ppr
- MedEthEx
- Hexlite
- KATARA
- MATLANG
- AWESOME
- Two alternatives for handling preferences in qualitative choice logic
- Extracting qualitative relations from categorical data
- Scaling-invariant maximum margin preference learning
- Lexicographically-ordered constraint satisfaction problems
- Explaining robust additive utility models by sequences of preference swaps
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms
- Pruning external minimality checking for answer set programs using semantic dependencies
- Voting in Combinatorial Domains: What Logic and AI Have to Say
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A postulate-based analysis of comparative preference statements
- Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
- Integration and propagation of a multi-criteria decision making model in constraint programming
- Graph aggregation
- Compactly representing utility functions using weighted goals and the Max aggregator
- Dealing with explicit preferences and uncertainty in answer set programming
- Probabilistic TCP-net
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints
This page was built for software: CP-nets
