A Processing Method for Inconsistent Answer Set Programs Based on Minimal Principle

Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.