Revisiting Reductants in the Multi-adjoint Logic Programming Framework

摘要

In this work, after revisiting the different notions of reductant arisen in the framework of multi-adjoint logic programming and akin frameworks, we introduce a new, more adequate, notion of reductant in the context of multi-adjoint logic programs. We study some of its properties and its relationships with other notions of reductants.