CP-nets

swMATH1374MaRDI QIDQ14114FDOQ14114

Author name not available (Why is that?)

Official website: http://www.jair.org/media/1234/live-1234-2225-jair.pdf

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

• Multi-context systems in dynamic environments
• Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
• LARS
• Łukasiewicz games: a logic-based approach to quantitative strategic interactions
• Axiomatic characterization of committee scoring rules
• Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
• An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
• Cubic preferences and the character admissibility problem
• Computing Utility from Weighted Description Logic Preference Formulas
• Conditional lexicographic orders in constraint satisfaction problems
• Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
• A new solver for the minimum weighted vertex cover problem
• Learning modulo theories for constructive preference elicitation
• Learning conditional preference networks
• Making choices with a binary relation: relative choice axioms and transitive closures
• On database queries involving competitive conditional preferences
• Extreme points of the credal sets generated by comparative probabilities
• 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
• Generic preferences over subsets of structured objects
• Meta-heuristic and constraint-based approaches for single-line railway timetabling
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Relational networks of conditional preferences
• Comparing multiagent systems research in combinatorial auctions and voting
• Explaining robust additive utility models by sequences of preference swaps
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Pruning external minimality checking for answer set programs using semantic dependencies
• Integration and propagation of a multi-criteria decision making model in constraint programming
• Dealing with explicit preferences and uncertainty in answer set programming
• Possibilistic preference networks
• Compactly representing utility functions using weighted goals and the Max aggregator
• Foundations of Information and Knowledge Systems
• Comparing the notions of optimality in CP-nets, strategic games and soft constraints
• CP- and OCF-networks -- a comparison
• Representing interval orders by weighted bases: some complexity results
• A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
• Aggregating preferences represented by conditional preference networks
• A General Framework for Expressing Preferences in Causal Reasoning and Planning
• Inferring latent class lexicographic rules from choice data
• The representation of conditional relative importance between criteria
• The complexity of exact learning of acyclic conditional preference networks from swap examples
• Contracting preference relations for database applications
• Democratic approximation of lexicographic preference models
• Nested preferences in answer set programming
• Decision-making with Sugeno integrals. Bridging the gap between multicriteria evaluation and decision under uncertainty
• Autonomous agents modelling other agents: a comprehensive survey and open problems
• Incremental evaluation of continuous preference queries
• Preference-based inconsistency-tolerant query answering under existential rules
• Erratum to: ``Database preference queries -- a possibilistic logic approach with symbolic priorities
• A reward-based approach for preference modeling: a case study
• A glimpse on Gerhard Brewka's contributions to artificial intelligence
• Logic Programming
• Soft constraint problems with uncontrollable variables
• Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
• Interactive exploration of multi-dimensional and hierarchical information spaces with real-time preference elicitation
• A model based on outranking for database preference queries
• A Snapshot on Reasoning with Qualitative Preference Statements in AI
• Multi resource allocation with partial preferences
• Scaling-invariant maximum margin preference learning
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Voting in Combinatorial Domains: What Logic and AI Have to Say
• Probabilistic TCP-net
• A flexible model for the evaluation of soft conditional preferences in fuzzy databases
• Planning as satisfiability with IPC simple preferences and action costs
• Argumentation-based preference modelling with incomplete information
• Compact Preference Representation in Stable Marriage Problems
• Probabilistic lexicographic preference trees
• CP-nets, \( \pi \)-pref nets, and Pareto dominance
• Combining totalitarian and Ceteris Paribus semantics in database preference queries
• Eliciting single-peaked preferences using comparison queries
• Nonmonotonic multi-context systems: a flexible approach for integrating heterogeneous knowledge sources
• MiniBrass: soft constraints for MiniZinc
• Solving satisfiability problems with preferences
• On the semantics of logic programs with preferences
• Modelling and learning user preferences over sets
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• 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
• 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
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Preference change
• On the qualitative comparison of decisions having positive and negative features
• Title not available (Why is that?)
• New islands of tractability of cost-optimal planning
• On the hardness of bribery variants in voting with CP-nets
• The complexity of planning problems with simple causal graphs
• On computing preferred MUSes and MCSes
• A distributed social choice protocol for combinatorial domains
• 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
• AFRA
• kappalab

This page was built for software: CP-nets