Browse our site
About
People
Research Areas
Projects
Publications
Books
Book chapters
Journal articles
In proceedings
M. Sc. Dissertations
Ph. D. Dissertations
Technical reports
Seminars
News
You are here:
Home
Publications
View
Publication details
Go back
Publication details
Main information
Title:
On the Computability and Complexity Issues of Extended RDF
Publication date:
December 2008
Citation:
AnastasiaADW08:pricai
Abstract:
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics.We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.
In proceedings
Authors:
Anastasia Analyti, Grigoris Antoniou,
Carlos Viegas Damásio
, Gerd Wagner
Editors:
Tu Bao Ho, Zhi-Hua Zhou
Book title:
Proceedings of PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence
Series:
Lecture Notes in Computer Science
Publisher:
Springer
Address:
Hanoi, Vietnam
Volume:
5351
Pages:
5-16
ISBN:
978-3-540-89196-3
ISSN:
-
Note:
-
Url address:
http://dx.doi.org/10.1007/978-3-540-89197-0_5
Export formats
Plain text:
Anastasia Analyti and Grigoris Antoniou and Carlos Viegas Damásio and Gerd Wagner, On the Computability and Complexity Issues of Extended RDF, in: Tu Bao Ho and Zhi-Hua Zhou (eds), Proceedings of PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Lecture Notes in Computer Science, Springer, Hanoi, Vietnam, Vol. 5351, ISBN 978-3-540-89196-3, Pag. 5-16, (http://dx.doi.org/10.1007/978-3-540-89197-0_5), December 2008.
HTML:
Anastasia Analyti, Grigoris Antoniou, <a href="/people/members/view.php?code=feecf7159d8e22c70a3bf33436444903" class="author">Carlos Viegas Damásio</a> and Gerd Wagner, <b>On the Computability and Complexity Issues of Extended RDF</b>, in: Tu Bao Ho and Zhi-Hua Zhou (eds), <u>Proceedings of PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence</u>, Lecture Notes in Computer Science, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, Hanoi, Vietnam, Vol. 5351, ISBN 978-3-540-89196-3, Pag. 5-16, (<a href="http://dx.doi.org/10.1007/978-3-540-89197-0_5" target="_blank">url</a>), December 2008.
BibTeX:
@inproceedings {AnastasiaADW08:pricai, author = {Anastasia Analyti and Grigoris Antoniou and Carlos Viegas Dam{\'a}sio and Gerd Wagner}, editor = {Tu Bao Ho and Zhi-Hua Zhou}, title = {On the Computability and Complexity Issues of Extended RDF}, booktitle = {Proceedings of PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Hanoi, Vietnam}, volume = {5351}, pages = {5-16}, isbn = {978-3-540-89196-3}, url = {http://dx.doi.org/10.1007/978-3-540-89197-0_5}, abstract = {ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics.We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.}, keywords = {Extended RDF ontologies, Semantic Web, negation, rules, complexity.}, month = {December}, year = {2008}, }
Publication's urls
Full url:
/publications/view.php?code=4a6b1147f10cd55fc5bbb352425627fc
Friendly url:
/publications/view.php?code=AnastasiaADW08:pricai
Go back
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541