RESEARCHarXiv CS.AI·26d ago
On the Size Complexity and Decidability of First-Order Progression
This paper investigates the size complexity and decidability of first-order progression, a method for updating knowledge bases in AI. It demonstrates that for specific action classes within the Situation Calculus framework, first-order progression grows polynomially and maintains decidability when using certain knowledge base fragments.
27