Browse wiki
From Semantic Portal Wiki
| Answer Set Programming Ankesh |
| Modification dateThis property is a special property in this wiki. | 20 November 2008 15:20:52 + |
|---|---|
| Question asked | My question is very general. The best case … 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? some restrictions on dl-atoms, be useful? |
| Question asked by | Ankesh Khandelwal + |
| Question for the Presentation | Jiao Journal Presentation + |
| Categories | Presentation Questions |
| hide properties that link here |
| No properties link to this page. |
