Use cases
Savanty fits discrete constraint satisfaction — problems where a finite set of decisions must satisfy a set of hard rules. Here are the families it handles well, each with a worked encoding.
Shift scheduling & rostering
Assign staff to shifts under coverage, availability, and fairness rules — described in English, solved to a guaranteed-consistent roster by Clingo.
AssignmentTask & resource assignment
Match tasks to workers (or jobs to machines) under skill, capacity, and balance rules — described in English and solved to a provably valid assignment.
TimetablingSeating & timetabling
Place people at tables or classes in slots under adjacency, conflict, and capacity rules — described in English, solved to a valid plan by Clingo.
CombinatorialGraph colouring
The classic constraint problem — colour a graph so no two adjacent nodes match — described in English and solved to a guaranteed valid colouring by Clingo.
CombinatorialLogic puzzles
Zebra puzzles, n-queens, sudoku-style constraints — described in English and solved exactly by Clingo, with every deduction guaranteed sound.