Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Reasoning on the Web with Open and Closed Predicates
December 2008
WagnerGDAAD08:alpsws
SQL, Prolog, RDF and OWL are among the most prominent and most widely used computational logic languages. However, SQL, Prolog and RDF do not allow the representation of negative information, only OWL does so. RDF does not even include any negation concept. While SQL and Prolog only support reasoning with closed predicates based on negation-as-failure, OWL supports reasoning with open predicates based on classical negation, only. However, in many practical application contexts, one rather needs support for reasoning with both open and closed predicates. To support this claim, we show that the well-known Web vocabulary FOAF includes all three kinds of predicates i.e. closed, open and partial predicates. Therefore, reasoning with FOAF data, as a typical example of reasoning on the Web, requires a formalism that supports the distinction between open and closed predicates. We argue that ERDF, an extension of RDF, offers a solution to deal with this problem.
In proceedings
Gerd Wagner, Adrian Giurca, Ion-Mircea Diaconescu, Grigoris Antoniou, Anastasia Analyti, Carlos Viegas Damásio
Proceedings of Third International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008), in conjunction with ICLP'08
-
-
Udine, Italy
-
-
-
-
-
http://oxygen.informatik.tu-cottbus.de/~mdiaconescu/website/publications/ALPSWS2008.pdf
Export formats
Gerd Wagner and Adrian Giurca and Ion-Mircea Diaconescu and Grigoris Antoniou and Anastasia Analyti and Carlos Viegas Damásio, Reasoning on the Web with Open and Closed Predicates, , Proceedings of Third International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008), in conjunction with ICLP'08, Udine, Italy, (http://oxygen.informatik.tu-cottbus.de/~mdiaconescu/website/publications/ALPSWS2008.pdf), December 2008.
Gerd Wagner, Adrian Giurca, Ion-Mircea Diaconescu, Grigoris Antoniou, Anastasia Analyti and <a href="/people/members/view.php?code=feecf7159d8e22c70a3bf33436444903" class="author">Carlos Viegas Damásio</a>, <b>Reasoning on the Web with Open and Closed Predicates</b>, <u>Proceedings of Third International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008), in conjunction with ICLP'08</u>, Udine, Italy, (<a href="http://oxygen.informatik.tu-cottbus.de/~mdiaconescu/website/publications/ALPSWS2008.pdf" target="_blank">url</a>), December 2008.
@inproceedings {WagnerGDAAD08:alpsws, author = {Gerd Wagner and Adrian Giurca and Ion-Mircea Diaconescu and Grigoris Antoniou and Anastasia Analyti and Carlos Viegas Dam{\'a}sio}, title = {Reasoning on the Web with Open and Closed Predicates}, booktitle = {Proceedings of Third International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS 2008), in conjunction with ICLP'08}, address = {Udine, Italy}, url = {http://oxygen.informatik.tu-cottbus.de/~mdiaconescu/website/publications/ALPSWS2008.pdf}, abstract = {SQL, Prolog, RDF and OWL are among the most prominent and most widely used computational logic languages. However, SQL, Prolog and RDF do not allow the representation of negative information, only OWL does so. RDF does not even include any negation concept. While SQL and Prolog only support reasoning with closed predicates based on negation-as-failure, OWL supports reasoning with open predicates based on classical negation, only. However, in many practical application contexts, one rather needs support for reasoning with both open and closed predicates. To support this claim, we show that the well-known Web vocabulary FOAF includes all three kinds of predicates i.e. closed, open and partial predicates. Therefore, reasoning with FOAF data, as a typical example of reasoning on the Web, requires a formalism that supports the distinction between open and closed predicates. We argue that ERDF, an extension of RDF, offers a solution to deal with this problem.}, month = {December}, year = {2008}, }
Publication's urls
/publications/view.php?code=fd0c52089cbccc64fd95fe6d42d69f23
/publications/view.php?code=WagnerGDAAD08:alpsws
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT