2009
DOI: 10.1007/978-3-642-05082-4_12
|View full text |Cite
|
Sign up to set email alerts
|

A Minimal Deductive System for General Fuzzy RDF

Abstract: Abstract. It is well-known that crisp RDF is not suitable to represent vague information. Fuzzy RDF variants are emerging to overcome this limitations. In this work we provide, under a very general semantics, a deductive system for a salient fragment of fuzzy RDF. We then also show how we may compute the top-k answers of the union of conjunctive queries in which answers may be scored by means of a scoring function.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(52 citation statements)
references
References 15 publications
0
51
0
Order By: Relevance
“…Furthermore, we could have fuzziness and we can consider this as an independent aspect (e.g. there are fuzzy extensions of the RDF model such as [10,16] Fig. 3 shows the above categories organized hierarchically where an option X is a (direct or indirect) child of an option Y if whatever information can be expressed in Y can also be expressed in X.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, we could have fuzziness and we can consider this as an independent aspect (e.g. there are fuzzy extensions of the RDF model such as [10,16] Fig. 3 shows the above categories organized hierarchically where an option X is a (direct or indirect) child of an option Y if whatever information can be expressed in Y can also be expressed in X.…”
Section: Related Workmentioning
confidence: 99%
“…For a property p ∈ P r we can define the edges , o ) is not directly supported), storing it into a relational DB, and then using internally SQL queries. For instance, [16] uses MonetDB with the following schema: type(subject, object, degree), subclassOf(subject, object, degree), subpropertyOf(subject, object, degree), and a table prop i (subject, object, degree) for every distinct property p i . Table 2 shows directly the SQL queries that are needed by our interaction model for Fuzzy RDF (again E could also be defined through another query).…”
Section: Path Expansion and Cyclesmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the running time should be inversely proportional to the speed, after eliminating the effect of the platform overhead, the system's performance speeds up linearly to the increase of number of units. [10] is the first work to extend RDFS with fuzzy vagueness. In [4], we further propose the fuzzy pD * semantics which allows some useful OWL vocabularies, such as TransitiveProperty and SameAs.…”
Section: Scalabilitymentioning
confidence: 99%
“…Briefly, an annotation v from a suitable mathematical structure is added to the ordinary triples (s p o) obtaining (s p o) : v, annotating with v the statement that subject s is related via property p to object o. The general semantics of this RDFS extension has been recently addressed [21,22] improving the initial work of [26], but only a memory-based Prolog implementation is available.…”
Section: Introductionmentioning
confidence: 99%