Add to ORKGAbstract. It is well-knwon that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF variants are emerging to overcome to 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.
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The prob...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
Abstract. Fuzzy Description Logics generalize crisp ones by providing membership degree semantics fo...
Abstract. It is well-known that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
International audienceIn a relational database context, fuzzy quantified queries have been long reco...
International audienceIn a relational database context, fuzzy quantified queries have been long reco...
This paper presents a minimalist program for RDF, by showing how one can do without several predica...
This paper presents a minimalist program for RDF, by showing how one can do without several predica...
We explore flexible querying of RDF data, with the aim of making it possible to return data satisfyi...
We explore flexible querying of RDF data, with the aim of making it possible to return data satisfyi...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The prob...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
Abstract. Fuzzy Description Logics generalize crisp ones by providing membership degree semantics fo...
Abstract. It is well-known that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
International audienceIn a relational database context, fuzzy quantified queries have been long reco...
International audienceIn a relational database context, fuzzy quantified queries have been long reco...
This paper presents a minimalist program for RDF, by showing how one can do without several predica...
This paper presents a minimalist program for RDF, by showing how one can do without several predica...
We explore flexible querying of RDF data, with the aim of making it possible to return data satisfyi...
We explore flexible querying of RDF data, with the aim of making it possible to return data satisfyi...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The prob...
[[abstract]]This paper proposes a logical reconstruction of the classical fuzzy relational database ...
Abstract. Fuzzy Description Logics generalize crisp ones by providing membership degree semantics fo...