Gerd Wagner, Adrian Giurca, Mircea Diaconescu, Grigoris Antoniou, Carlos Viegas Damásio:
Mircea Diaconescu (editor):
ERDF Implementation and Evaluation.

Complete Text [
.pdf, 503KB]
In: (I1-D14)

SQL, Prolog, RDF and OWL are among the most prominent and most widely used computa- tional logic languages. SQL, Prolog and RDF do not allow to represent negative information, only OWL does so. RDF does even not include any negation concept. While SQL and Pro- log 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 three kinds of predicates, which we call closed, open and partial predicates. Therefore, rea- soning 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.



	url = {}