Answer Set Programming Ankesh

From Semantic Portal Wiki

Jump to: navigation, search
  • Question is for the Presentation: Jiao Journal Presentation
  • Question is asked by: Ankesh Khandelwal
  • The Question is: 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?
Retrieved from "http://tw.rpi.edu/portal/Answer_Set_Programming_Ankesh"
Facts about Answer Set Programming AnkeshRDF feed
Question askedMy 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 byAnkesh Khandelwal  +
Question for the PresentationJiao Journal Presentation  +
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance