We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
This paper proposes an approach aimed at obviating empty answers for a family of conjunctive queries involving Boolean or fuzzy value constraints. Contrary to the approaches based ...
Patrick Bosc, Carmen Brando, Allel HadjAli, H&eacu...
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Desc...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, E...
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...