中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs

文献类型:期刊论文

作者Zhang, Zaiyue; Sui, Yuefei; Cao, Cungen
刊名THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
出版日期2006
卷号3959页码:588-600
关键词logic programs double priority tree method
ISSN号0302-9743
英文摘要One of the most important works in the investigation of logic programming is to define the semantics of the logic programs and to find the preferable answer set of them. There are so far three methods can be used to establish the semantics of the logic programs, i.e., the means of model, fixpoint and proof theory. According to the form of the rules contained in a logic program, different logic program classes can be defined. Although well-defined semantics exist for some restricted classes of programs like Horn and stratified Programs, the declarative semantics of the more general program classes are still the subject of research. In this paper, the properties of the basic disjunctive logic programming are studied, and the notion of double prioritization is introduced, that is, the prioritization on both literals and clauses, by which the most preferable answer set of a basic disjunctive logic program is defined. In order to obtain the most preferable answer set of a basic disjunctive logic program explicitly, a recursion-theoretic construction called tree method is given.
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:000238091800056
出版者SPRINGER-VERLAG BERLIN
源URL[http://119.78.100.204/handle/2XEOYT63/10627]  
专题中国科学院计算技术研究所期刊论文_英文
作者单位Chinese Acad Sci, Comp Technol Inst, Key Lab Intelligent Informat Proc, Beijing 100864, Peoples R China
推荐引用方式
GB/T 7714
Zhang, Zaiyue,Sui, Yuefei,Cao, Cungen. A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs[J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS,2006,3959:588-600.
APA Zhang, Zaiyue,Sui, Yuefei,&Cao, Cungen.(2006).A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs.THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS,3959,588-600.
MLA Zhang, Zaiyue,et al."A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs".THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS 3959(2006):588-600.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。