Loop Formulas for Description Logic Programs

Details Loop Formulas for Description Logic Programs Loop Formulas for Description Logic Programs

2010-07-23

arxiv.org/abs/1007.4040v1

yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen: Loop formulas for description logic programs. TPLP 10(4-6): 531-545 (201

Computer Science

Artificial Intelligence

29 pages, 1 figures (in pdf), a short version appeared in ICLP'10

Scientific paper

10.1017/S1471068410000268

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 {\em 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.

Affiliated with

Also associated with

No associations

Rating

Loop Formulas for Description Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Loop Formulas for Description Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loop Formulas for Description Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138459