The following pages link to Francesco Santini (Q344545):
Displayed 33 items.
- Residuation for bipolar preferences in soft constraints (Q344546) (← 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)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Residuation for soft constraints: lexicographic orders and approximation techniques (Q2055790) (← links)
- Defeasible logic programming in satisfiability modulo CHR (Q2294079) (← links)
- Well-foundedness in weighted argumentation frameworks (Q2296697) (← links)
- A Hasse diagram for weighted sceptical semantics with a unique-status grounded semantics (Q2401923) (← links)
- Observational and behavioural equivalences for soft concurrent constraint programming (Q2403819) (← links)
- Distributivity and residuation for lexicographic orders (Q2671819) (← 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 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)
- There are Two Sides to Every Question (Q3460874) (← 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)
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive (Q4684353) (← links)
- (Q5039143) (← links)
- From Marriages to Coalitions: A Soft CSP Approach (Q5191403) (← links)
- A Secure Non-monotonic Soft Concurrent Constraint Language (Q5259265) (← links)
- SCLP for Trust Propagation in Small-World Networks (Q5302723) (← links)
- Soft constraint automata with memory (Q5918138) (← links)
- Soft constraint automata with memory (Q5918271) (← links)