The following pages link to Stefano Bistarelli (Q239556):
Displaying 50 items.
- (Q353301) (redirect page) (← links)
- Interchangeability with thresholds and degradation factors for soft CSPs (Q353304) (← links)
- A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials (Q692280) (← links)
- A novel weighted defence and its relaxation in abstract argumentation (Q1687271) (← links)
- Semirings for constraint solving and programming. (Q1882811) (← links)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Introducing a tool for concurrent argumentation (Q2055775) (← links)
- Energy allocation and payment: a game-theoretic approach (Q2202516) (← links)
- A possible world view and a normal form for the constellation semantics (Q2296696) (← links)
- Well-foundedness in weighted argumentation frameworks (Q2296697) (← links)
- Probabilistic abstract argumentation frameworks, a possible world view (Q2300457) (← links)
- A Hasse diagram for weighted sceptical semantics with a unique-status grounded semantics (Q2401923) (← links)
- Abstracting soft constraints: framework, properties, examples (Q2676586) (← links)
- A definition of sceptical semantics in the constellations approach (Q2694551) (← links)
- A Relaxation of Internal Conflict and Defence in Weighted Argumentation Frameworks (Q2835867) (← links)
- Coalitions of arguments: an approach with constraint programming (Q2841955) (← links)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming (Q2870287) (← links)
- Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic (Q2921959) (← links)
- Unicast and multicast QoS routing with soft-constraint logic programming (Q2946622) (← links)
- On merging two trust-networks in one with bipolar preferences (Q2971064) (← links)
- A Common Computational Framework for Semiring-based Argumentation Systems (Q2999123) (← links)
- Solving Distributed CSPs Probabilistically (Q3084980) (← links)
- Solving Weighted Argumentation Frameworks with Soft Constraints (Q3085933) (← links)
- C-semiring Frameworks for Minimum Spanning Tree Problems (Q3184724) (← links)
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation* (Q3187009) (← links)
- (Q3225701) (← links)
- Local Expansion Invariant Operators in Argumentation Semantics (Q3305687) (← links)
- Solving finite domain constraint hierarchies by local consistency and tree search (Q3401378) (← links)
- Semiring-Based Soft Constraints (Q3507363) (← links)
- From soft constraints to bipolar preferences: modelling framework and solving issues (Q3566580) (← links)
- Bipolar Preference Problems: Framework, Properties and Solving Techniques (Q3608446) (← links)
- Semiring-based constraint satisfaction and optimization (Q4377273) (← links)
- (Q4424852) (← links)
- (Q4434826) (← links)
- (Q4536717) (← links)
- From Argumentation Frameworks to Voting Systems and Back* (Q4589600) (← links)
- Timed soft concurrent constraint programs: An interleaved and a parallel approach (Q4593013) (← links)
- A Quantitative Partial Model-Checking Function and Its Optimisation (Q4645744) (← links)
- Soft constraint programming to analysing security protocols (Q4669650) (← links)
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive (Q4684353) (← links)
- (Q4738345) (← links)
- (Q5039143) (← links)
- Ranking-based semantics from the perspective of claims (Q5145803) (← links)
- From Marriages to Coalitions: A Soft CSP Approach (Q5191403) (← links)
- Solving CSPs with Naming Games (Q5191404) (← links)
- Defence outsourcing in argumentation (Q5215687) (← links)
- A Secure Non-monotonic Soft Concurrent Constraint Language (Q5259265) (← links)
- Soft concurrent constraint programming (Q5277756) (← links)
- SCLP for Trust Propagation in Small-World Networks (Q5302723) (← links)
- A Soft Approach to Multi-objective Optimization (Q5504696) (← links)
