一种改进的处理不一致的回答集程序的方法

Improved Method to Process Inconsistent Answer Set Program

回答集程序设计是一种描述性的程序设计范例,目前成为逻辑程序设计领域中一个很重要、很活跃的研究课题。在实际应用中,由于知识的不一致性,使得程序没有回答集。为解决该问题,朱涛等人提出了基于最小原理的思想,它可以很好地处理不一致的回答集程序,但是该方法会删除对用户来说很重要的知识,并且无法根据用户自己的偏好找到最满意的解。针对该问题,以加权逻辑程序为基础,使用加权定量的方法来处理不一致的回答集程序。通过为每一个规则分配权值,权值表示废除该规则所需的代价,废除规则代价之和最小的作为最优解,方便而简洁地解决了在无解情况下求解最满意解的问题。最后,与相关工作进行比较。

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.