CTLF is a branching-time logic with counting-worlds semantics for verifying fairness in probability distributions over protected attributes, predicting bias bounds, and calculating outputs to remove in generative AI series.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2representative citing papers
citing papers explorer
-
Counting Worlds Branching Time Semantics for post-hoc Bias Mitigation in generative AI
CTLF is a branching-time logic with counting-worlds semantics for verifying fairness in probability distributions over protected attributes, predicting bias bounds, and calculating outputs to remove in generative AI series.
- A Linear Temporal Logic of Frequencies on Series of Events