A new paper analyzes the size and complexity of first-order progression in knowledge bases, demonstrating that it grows polynomially under certain conditions. This advancement ensures that first-order progression remains decidable and practical for applications in reasoning about actions.