A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs

	A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs
	Zhang, Zaiyue; Sui, Yuefei; Cao, Cungen
	2006
发表期刊	THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
ISSN	0302-9743
卷号	3959 页码:588-600
摘要	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.
关键词	logic programs double priority tree method
收录类别	SCI
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Theory & Methods ; Mathematics, Applied
WOS记录号	WOS:000238091800056
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/10628
专题	中国科学院计算技术研究所期刊论文_英文
作者单位	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.