We present circular assume-guarantee reasoning rules automated by an appropriate use of passive learning algorithms for automata and LTL formulas. Both algorithms directly apply to systems made of not just two but multiple components. Moreover the algorithms are modular in the sense that they can be instantiated by any external learning algorithm and model checker. We present experiments showing the feasability of our approach.