%0 Conference Paper %1 puehrer-eswc2010 %A Pührer, Jörg %A Heymans, Stijn %A Eiter, Thomas %B Proc. of 7th Extended Semantic Web Conference (ESWC 2010) %D 2010 %E Aroyo, Lora %E Antoniou, Grigoris %E Hyvönen, Eero %E ten Teije, Annette %E Stuckenschmidt, Heiner %E Cabral, Liliana %E Tudorache, Tania %I Springer Berlin / Heidelberg %K ontologies ontorule reasoning rules %P 183-197 %T Dealing with Inconsistency when Combining Ontologies and Rules using DL-Programs %U http://stijnheymans.net/pubs/eswc2010.pdf %V 6088 %X Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely combines a Description Logic (DL) ontology with a non-monotonic logic program (LP) such that dedicated atoms in the LP, called DL-atoms, allow for a bidirectional flow of knowledge between the two components. Unfortunately, the information sent from the LP-part to the DL-part might cause an inconsistency in the latter, leading to the trivial satisfaction of every query. As a consequence, in such a case, the answer sets that define the semantics of the DL-program may contain spoiled information influencing the overall deduction. For avoiding unintuitive answer sets, we introduce a refined semantics for DL-programs that is sensitive for inconsistency caused by the combination of DL and LP, and dynamically deactivates rules whenever such an inconsistency would arise. We analyze the complexity of the new semantics, discuss implementational issues and introduce a notion of stratification that guarantees uniqueness of answer sets.

@inproceedings{puehrer-eswc2010, abstract = {Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely combines a Description Logic (DL) ontology with a non-monotonic logic program (LP) such that dedicated atoms in the LP, called DL-atoms, allow for a bidirectional flow of knowledge between the two components. Unfortunately, the information sent from the LP-part to the DL-part might cause an inconsistency in the latter, leading to the trivial satisfaction of every query. As a consequence, in such a case, the answer sets that define the semantics of the DL-program may contain spoiled information influencing the overall deduction. For avoiding unintuitive answer sets, we introduce a refined semantics for DL-programs that is sensitive for inconsistency caused by the combination of DL and LP, and dynamically deactivates rules whenever such an inconsistency would arise. We analyze the complexity of the new semantics, discuss implementational issues and introduce a notion of stratification that guarantees uniqueness of answer sets.}, added-at = {2011-03-02T10:10:42.000+0100}, author = {Pührer, Jörg and Heymans, Stijn and Eiter, Thomas}, biburl = {https://www.bibsonomy.org/bibtex/2ace8a08266d5f0f39d41f15e3f01c0bd/ontorule}, booktitle = {Proc. of 7th Extended Semantic Web Conference (ESWC 2010)}, editor = {Aroyo, Lora and Antoniou, Grigoris and Hyvönen, Eero and ten Teije, Annette and Stuckenschmidt, Heiner and Cabral, Liliana and Tudorache, Tania}, interhash = {f5f15d4ca0fa388d5168708bd6079331}, intrahash = {ace8a08266d5f0f39d41f15e3f01c0bd}, keywords = {ontologies ontorule reasoning rules}, pages = {183-197}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2011-03-02T10:10:42.000+0100}, title = {Dealing with Inconsistency when Combining Ontologies and Rules using DL-Programs}, url = {http://stijnheymans.net/pubs/eswc2010.pdf}, volume = 6088, year = 2010 }