the loop formula based semantics of description logic programs

ISCAS OpenIR

	the loop formula based semantics of description logic programs
	Yisong Wang; Jia-Huai You; Li Yan Yuan; Yi-Dong Shen; Mingyi Zhang
	2011
发表期刊	Theoretical Computer Science
ISSN	0304-3975
卷号	415 页码:-
摘要	Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored and we compare the canonical answer set semantics with the FLP-semantics and the answer set semantics by translating dl-programs into logic programs with abstract constraints. We present a clear picture on the relationship among these semantics variations for dl-programs.; Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored and we compare the canonical answer set semantics with the FLP-semantics and the answer set semantics by translating dl-programs into logic programs with abstract constraints. We present a clear picture on the relationship among these semantics variations for dl-programs.
收录类别	SCIENCEDIRECT ; EI
关键词	Semantic Web Answer Sets Description Logic Programs Loop Formulas
部门归属	aSchool of Computer Science and Information Guizhou University Guiyang 550025 China; bDepartment of Computing Science University of Alberta Edmonton Alberta Canada T6G 2R3; cState Key Laboratory of Computer Science Institute of Software ChineseAcademy of Sciences 100190 China; dGuizhou Academy of Sciences Guiyang 550001 China
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16017
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Yisong Wang,Jia-Huai You,Li Yan Yuan,et al. the loop formula based semantics of description logic programs[J]. Theoretical Computer Science,2011,415:-.
APA	Yisong Wang,Jia-Huai You,Li Yan Yuan,Yi-Dong Shen,&Mingyi Zhang.(2011).the loop formula based semantics of description logic programs.Theoretical Computer Science,415,-.
MLA	Yisong Wang,et al."the loop formula based semantics of description logic programs".Theoretical Computer Science 415(2011):-.