The following pages link to Francesca Rossi (Q239558):
Displaying 50 items.
- A Borda count for collective sentiment analysis (Q314431) (← links)
- Interval-valued soft constraint problems (Q616770) (← links)
- (Q646533) (redirect page) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints (Q1029586) (← links)
- Constraint retraction in CLP(FD): Formal framework and performance results (Q1294043) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Partial order and contextual net semantics for atomic and locally atomic CC programs (Q1380121) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- Contextual nets (Q1902298) (← links)
- Graph rewriting, constraint solving and tiles for coordinating distributed systems (Q1971975) (← links)
- Cognitive hierarchy and voting manipulation in \(k\)-approval voting (Q2019338) (← links)
- Gibbard-Satterthwaite games for \(k\)-approval voting rules (Q2334861) (← links)
- Constraint relaxation may be perfect (Q2384384) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
- Abstracting soft constraints: framework, properties, examples (Q2676586) (← links)
- (Q2736348) (← links)
- Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score (Q2868553) (← links)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming (Q2870287) (← links)
- Unicast and multicast QoS routing with soft-constraint logic programming (Q2946622) (← links)
- Soft constraint problems with uncontrollable variables (Q3065449) (← links)
- (Q3388740) (← links)
- Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop (Q3449519) (← links)
- (Q3493317) (← links)
- Semiring-Based Soft Constraints (Q3507363) (← links)
- Dealing with Incomplete Preferences in Soft Constraint Problems (Q3523064) (← links)
- From soft constraints to bipolar preferences: modelling framework and solving issues (Q3566580) (← links)
- Constraint Logic Programming (Q3578391) (← links)
- Bipolar Preference Problems: Framework, Properties and Solving Techniques (Q3608446) (← links)
- (Q3624044) (← links)
- Aggregating Partially Ordered Preferences (Q3632765) (← links)
- Compact Preference Representation in Stable Marriage Problems (Q3645333) (← links)
- (Q3786030) (← links)
- (Q4037311) (← links)
- (Q4312458) (← links)
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions (Q4327411) (← links)
- Semiring-based constraint satisfaction and optimization (Q4377273) (← links)
- Learning solution preferences in constraint problems (Q4420777) (← links)
- (Q4424856) (← links)
- An interactive semantics of logic programming (Q4452646) (← links)
- (Q4536717) (← links)
- (Q4537510) (← links)
- An event structure semantics for graph grammars with parallel productions (Q4645280) (← links)
- Synchronized composition of graph grammar productions (Q4645281) (← links)
- (Q4738345) (← links)
