]> 2012-05-28T00:32:37-04:00 Answer Set Programming Ankesh My question is very general. The best case complexity is EXP, for DL-Lite and positive dl-program. Given the intractability of the answer-set-programming approach combined with DL reasoning, do you think it can be used for some semantic web applications? Can considering a subset, say by putting some restrictions on dl-atoms, be useful? Jiao Journal Presentation Question for the Presentation Ankesh Khandelwal Question asked by Question asked Presentation Questions