logic programs with abstract constraints: representaton, disjunction and complexities

	logic programs with abstract constraints: representaton, disjunction and complexities
	You Jia-Huai; Yuan Li Yan; Liu Guohua; Shen Yi-Dong
	2007
会议名称	9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	228-240
会议日期	43966
会议地点	Tempe, AZ, United states
收录类别	EI
出版地	Germany
ISSN	3029743
ISBN	9783540721994
部门归属	(1) Department of Computing Science, University of Alberta, Edmonton, Alta., Canada; (2) Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
摘要	We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs composed of ordinary atoms. This approach
关键词	Constraint Theory Problem Solving Set Theory
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/11178
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	You Jia-Huai,Yuan Li Yan,Liu Guohua,et al. logic programs with abstract constraints: representaton, disjunction and complexities[C]. Germany,2007:228-240.