Which F-Logic fragment corresponds how to which SWRL fragment? (copied from deri-wsmo-discussion, thread:

FvH> how weak must subsets of SWRL and

FvH> pragmatic FLogic be before they start to diverge?

MK> My guess is that they coincide on their pure Horn subsets and that

MK> this is the maximal such subset.

FvH> Thanks again for confirming this. I still think the rules must also be

FvH> non-recursive for the two to coincide (from another point in your

FvH> email, I think we agree on this).

RV> Personally, I don't understand why rules have to be non-recursive. This

RV> is definitely not the case for the DLP fragment.

MK> I don't understand either. Why does recursion fall outside of the intersection of SWRL and F-logic?

…

MK> But in SWRL you can have recursion, no?

RV> Yes.

MK> So then recursion is in the intersection, I think.

Reference for complexity & decidability of Logic Programming: Complexity and Expressive Power of Logic Programming , E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov

TR version, 1999: http://www.kr.tuwien.ac.at/research/reports/rr9905.ps.gz

Should be one of the next presentations probably in the DERI research seminar!