Abstract: Answer Set Programming(ASP) is a kind of declarative programming.At present,ASP has become an important and active research in the field of logic programming.In practical applications,one of the possibles in answer set programming is the absence of any solutions in case of inconsistent information.To remedy this,Zhu Tao presented a minimal principle based method to process inconsistency in ASP.However,this method will delete the most important information for users and can’t find the most satisfactory solution according to their own preferences.In order to solve this problem,based on weight logic program and using a weight quantitative method that associates a weight with each rule in a program,these weights define the “cost” of deleting a rule,the solution is preferred if it minimizes the sum of the weights of its deleted rules and after that,we compared this method with related work.

Key words: ASP,Knowledge representation,Inconsistency,Minimal principle,Weight quantitative