Show simple item record

dc.contributor.authorShen, Yi-Dong
dc.contributor.authorWang, Kewen
dc.contributor.editorAroyo, L
dc.contributor.editorWelty, C
dc.contributor.editorAlani, H
dc.contributor.editorTaylor, J
dc.contributor.editorBernstein, A
dc.contributor.editorKagal, L
dc.contributor.editorNoy, N
dc.contributor.editorBlomqvist, E
dc.date.accessioned2017-05-03T14:10:58Z
dc.date.available2017-05-03T14:10:58Z
dc.date.issued2011
dc.date.modified2012-07-24T22:28:06Z
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-642-25073-6_40
dc.identifier.urihttp://hdl.handle.net/10072/43949
dc.description.abstractRecently much attention has been directed to extending logic programming with description logic (DL) expressions, so that logic programs have access to DL knowledge bases and thus are able to reason with ontologies in the Semantic Web. In this paper, we propose a new extension of logic programs with DL expressions, called normal DL logic programs. In a normal DL logic program arbitrary DL expressions are allowed to appear in rule bodies and atomic DL expressions (i.e., atomic concepts and atomic roles) allowed in rule heads. We extend the key condition of well-supportedness for normal logic programs under the standard answer set semantics to normal DL logic programs and define an answer set semantics for DL logic programs which satisfies the extended well-supportedness condition. We show that the answer set semantics for normal DL logic programs is decidable if the underlying description logic is decidable (e.g. SHOIN or SROIQ).
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent131104 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeGermany
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom633
dc.relation.ispartofpageto648
dc.relation.ispartofjournalLecture Notes in Computer science
dc.relation.ispartofvolume7031
dc.rights.retentionY
dc.subject.fieldofresearchArtificial intelligence not elsewhere classified
dc.subject.fieldofresearchcode460299
dc.titleExtending Logic Programs with Description Logic Expressions for the Semantic Web
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, Griffith School of Engineering
gro.rights.copyright© 2011 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
gro.date.issued2011
gro.hasfulltextFull Text
gro.griffith.authorWang, Kewen


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record