摘要
回答集程序设计(ASP)是一种主流的非单调知识表示工具。为了能够在利用ASP求解问题过程中使用现有的以经典逻辑表示的知识,给出了一种把以谓词逻辑公式表示的约束型知识和定义型知识转化为ASP程序或知识库的新方法,并以实例说明了其有效性。该方法满足转化后ASP程序的回答集与原公式集的模型具有一一对应关系。在实际应用中,该方法提供了一项从现存的以谓词逻辑为表示语言的知识库,构建以ASP为知识表示语言的非单调知识库的技术。
Answer Set Programming (ASP) is now a mainstream tool for the representation of non-monotonic knowledge. In order to make use of the existing knowledge in classic logic in the process of using ASP for problem solving, a method was proposed for translating knowledge in classic logic formulas to an ASP program or ASP knowledge base so that the models of the formulas and the answer sets of the ASP program were in one-to-one cor-respondence. Some examples were presented to illustrate the effectiveness of the method. Two classes of knowledge were distinguished in this paper, i.e. constraint knowledge that requires a formula to be satisfactory and definition knowledge that defines a predicate. In practice, the method provides a way of building non-monotonic ASP knowledge bases from the existing knowledge bases that use predicate logic as representation language.
出处
《计算机应用》
CSCD
北大核心
2010年第11期2932-2936,共5页
journal of Computer Applications
基金
国家自然科学基金资助项目(60803033
60903079)
关键词
谓词逻辑
谓词公式
回答集程序设计
ASP知识库
predicate logic
predicate formula
Answer Set Programming (ASP)
ASP knowledge base