An inconsistency-adaptive proof procedure for logic programming

It is the goal of this paper to define a paraconsistent proof procedure that has the best of two mechanisms, in casu logic programming and inconsistency-adaptive logics. From logic programming we will maintain the ease of computing, and from adaptive logics their paraconsistency, dynamics and non-monotonicity. This will be done by combining the notion of competitor from logic programming with the conditionallity that is common in all adaptive proofs