Exact Query Reformulation with First-Order Ontologies and Databases

Franconi, Enrico; Kerhet, Volha; Ngo, Nhung

doi:10.1007/978-3-642-33353-8_16

Cited by 7 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, Google-style modifications of SPARQL queries are provided in terms of monotonic generalisations and refinements, i. e., removing query patterns or adding new query patterns. Finally it is worth mentioning that there is also work on exact query reformulation on OWL-DL ontologies [7]. In summary, many approaches for query recommendation developed so far require the availability of a proper query log for extracting ranking information.…”

Section: Related Workmentioning

confidence: 99%

Providing Alternative Declarative Descriptions for Entity Sets Using Parallel Concept Lattices

Gottron

Scherp

Scheglmann

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose an approach for modifying a declarative description of a set of entities (e.g., a SPARQL query) for the purpose of finding alternative declarative descriptions for the entities. Such a shift in representation can help to get new insights into the data, to discover related attributes, or to find a more concise description of the entities of interest. Allowing the alternative descriptions furthermore to be close approximations of the original entity set leads to more flexibility in finding such insights. Our approach is based on the construction of parallel formal concept lattices over different sets of attributes for the same entities. Between the formal concepts in the parallel lattices, we define mappings which constitute approximations of the extent of the concepts. In this paper, we formalise the idea of two types of mappings between parallel concept lattices, provide an implementation of these mappings and evaluate their ability to find alternative descriptions in a scenario of several real-world RDF data sets. In this scenario, we use descriptions for entities based on RDF classes and seek for alternative representations based on properties associated with the entities.

show abstract

Section: Related Workmentioning

confidence: 99%

Providing Alternative Declarative Descriptions for Entity Sets Using Parallel Concept Lattices

Gottron

Scherp

Scheglmann

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…To emphasize the relationship between database tables and DBox concept and roles, we will often write the assertions for the concept or role in tabular form, as in the case of the hasSpouse role in the KB (1) above. It can been shown (see [8]) that it is harmless to drop the standard name assumption for DBox individuals, in presence of the unique name conditions for DBox individuals: the spurious models in the weaker KB are indistinguishable from the good ones. It is also possible to fully encode a KB with a DBox into an equivalent KB in an expressive description logic such as SROIQ(D) or OWL (see [7]).…”

Section: Dboxesmentioning

confidence: 99%

“…We introduce in this section the definition of concepts and roles completely specified from DBox predicates, a notion strictly related to determinacy and implicit definability [2,8].…”

Section: Completely Specified Concepts and Rolesmentioning

confidence: 99%

See 1 more Smart Citation

Ontology Constraints in Incomplete and Complete Data

Patel‐Schneider

Franconi

2012

The Semantic Web – ISWC 2012

Self Cite

View full text Add to dashboard Cite

Abstract. Ontology and other logical languages are built around the idea that axioms enable the inference of new facts about the available data. In some circumstances, however, the data is meant to be complete in certain ways, and deducing new facts may be undesirable. Previous approaches to this issue have relied on syntactically specifying certain axioms as constraints or adding in new constructs for constraints, and providing a different or extended meaning for constraints that reduces or eliminates their ability to infer new facts without requiring the data to be complete. We propose to instead directly state that the extension of certain concepts and roles are complete by making them DBox predicates, which eliminates the distinction between regular axioms and constraints for these concepts and roles. This proposal eliminates the need for special semantics and avoids problems of previous proposals.

show abstract

“…See for example [H01], or a recent thesis [F15] for a survey 2 . The contexts where such scenario appears include for example query optimization and caching [DPT99], or -to see more recent examples - [FG12] where the view update problem is studied and [FKN13] where the context are description logics. In all the examples we mentioned so far we "prefer" Q 0 to be determined by Q.…”

Section: Introductionmentioning

confidence: 99%