Semiring-Based Soft Constraint Solving and Argumentation
summary
Introduces algebraic semirings inside CSPs and argumentation to turn feasibility checks into optimisation over semiring values, defines constraints as functions V→D→A with semiring combination = times and projection = plus, and shows local consistency generalises by using residuation to approximate division so probabilistic semirings still get pruning (but not exact). Presents a working prototype that encodes weighted argumentation as a CSP, demonstrates fuzzy and weighted examples, and lists a book and tool links for replication.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:23Semirings in constraint solving
- 2:50Constraint satisfaction basics
- 7:14Challenges in solving constraint satisfaction problems
- 9:41Why semirings help
- 13:21Soft constraints with semirings
- 15:16Local consistency for soft constraints
- 18:25Residuation theory
- 21:02Semirings in argumentation
- 24:15Weighted attacks in argumentation
- 26:05Relaxed conflict-free semantics
- 26:48Tools and resources
- 27:31Q&A