Eiter2008combining question 1 by lebo
From Semantic Portal Wiki
CSCI 6966 Advanced Semantic Web (Fall 2008)
- syllabus, announcements, presentations
- Lesson 1, Lesson 2, Lesson 3, Lesson 4, Lesson 5, Lesson 6,
- Lesson 7, Lesson 8, Lesson 9, Lesson 10, Lesson 11, Lesson 12, Lesson 13
A Question from Tim Lebo about eiter2008combining:
The paper describes a "conservative extension" to the combination of DL's first-order semantics and logic programming's answer set semantics, where knowledge can be transferred between a DL knowledge base and a logic programming program. When describing how dl-programs can express the closed-world assumption "on top" of an external DL knowledge base, negation is asserted despite its DL provability.
- Could an inconsistency arise when the CWA assertions are shared with the DL knowledge base?
- I'm not familiar with logic programming and answer sets -- and reading the paper left me interested, impressed, and confused. Could you explain the gist of logic programming and how answer set semantics differs from description logic semantics? It sounds pretty cool.
- Answer:
Facts about Eiter2008combining question 1 by leboRDF feed
| A | Question + |
| About | Eiter2008combining + |
| Author | Tim Lebo + |
| Question asked | The paper describes a "conservative extens … The paper describes a "conservative extension" to the combination of DL's first-order semantics and logic programming's answer set semantics, where knowledge can be transferred between a DL knowledge base and a logic programming program. When describing how dl-programs can express the closed-world assumption "on top" of an external DL knowledge base, negation is asserted despite its DL provability.
|
| Question asked by | Tim Lebo + |
| Question for the Presentation | Jiao Journal Presentation + |
| Text | The paper describes a "conservative extens … The paper describes a "conservative extension" to the combination of DL's first-order semantics and logic programming's answer set semantics, where knowledge can be transferred between a DL knowledge base and a logic programming program. When describing how dl-programs can express the closed-world assumption "on top" of an external DL knowledge base, negation is asserted despite its DL provability.
|
