In evaluating semantic similarity, word senses are crucial, and word senses vary with context. In the literature, existing word sense disambiguation methods are often expensive, limited, and may require human intervention. Moreover, identifying the correct sense of words can often be subjective even for humans. For these reasons, we propose a fuzzy approach that incorporates all possible contexts and associated senses of words by leveraging the BabelNet encyclopedic dictionary. A previous experiment using the most representative taxonomy-based similarity measures demonstrates that our proposal improves Pearson correlation with human judgment for all selected measures.

Abstract In this paper, we address the problem of answering complex questions formulated by users in natural language. Since traditional information retrieval systems are not suitable for complex questions, these questions are usually run over knowledge bases, such as Wikidata or DBpedia. We propose a semi-automatic approach for transforming a natural language question into a SPARQL query that can be easily processed over a knowledge base. The approach applies classification techniques to associate a natural language question with a proper query template from a set of predefined templates. The nature of our approach is semi-automatic as the query templates are manually written by human assessors, who are the experts of the knowledge bases, whereas the classification and query processing steps are completely automatic. Our experiments on the large-scale CSQA dataset for question-answering corroborate the effectiveness of our approach.

Semantic similarity search is one of the most promising methods for improving the performance of retrieval systems. This paper presents a new probabilistic method for ontology weighting based on a Bayesian approach. In particular, this work addresses the semantic search method SemSim for evaluating the similarity among a user request and semantically annotated sources. Each resource is annotated with a vector of features (annotation vector), i.e., a set of concepts defined in a reference ontology. Analogously, a user request is represented by a collection of desired features. The paper shows, on the bases of a comparative study, that the adoption of the Bayesian weighting method improves the performance of the SemSim method.

This paper presents a method for evaluating concept similarity within Fuzzy Formal Concept Analysis. In the perspective of developing the Semantic Web, such a method can be helpful when the digital resources found on the Internet cannot be treated equally and the integration of fuzzy data becomes fundamental for the search and discovery of information in the Web.

EXtensible Markup Language (XML)-Schemas are the emerging standards for describing and validating semi-structured documents across the Internet, due to the rich set of modeling constructors, types and constraints they provide. Semantic similarity is growing in importance in different settings, such as digital libraries, heterogeneous databases and, in particular, the Semantic Web. The focus of this paper is the definition of a method for determining semantic similarity of XML-Schema elements in the presence of type hierarchies. Such a method has been defined by combining and revisiting: (i) the information content approach, and (ii) a method for comparing the structural components of type declarations, inspired by the maximum weighted matching problem in bipartite graphs.

XML-Schemas and domain ontologies are two key features of the Semantic Web. The possibility of assessing similarity between concepts is becoming a fundamental support in e-commerce and business transactions. In this paper a method for evaluating similarity of XML-Schema elements is proposed, by making use of domain ontologies. The method is inspired by a previous proposal concerning concept similarity within an enterprise ontology management system developed at IASI.

The eXtensible Markup Language (XML) and XML-Schema are increasingly becoming the languages of choice to exchange data and describe data across the Internet, respectively. In this perspective, much of the database research focus is shifting from the traditional database models to the semistructured data and XML. In this paper, a formal framework supporting the design of XML-Schema type hierarchies has been proposed, by following and revisiting the database approach. In particular, the notion of a legal XML-Schema type hierarchy has been formally given and an algorithm for checking the legality of type hierarchies has been proposed.

The possibility of assessing the similarity between concepts is growing in importance. One of the primary reasons for this is the development of the Net Economy that requires a high level of computer support and flexibility in doing business. In business transactions, similarity plays an important role. It is constantly used whenever certain goods or services are not available with the required characteristics. Then a substitute may be accepted, as far as it is sufficiently close to what was originally required. In this paper we propose a method for evaluating concept similarity. The work has been performed within the SymOntos project concerning the development of a symbolic ontology management system, where concepts are defined in accordance with a frame-oriented approach.

Checking satisfiability of database constraints is a fundamental problem in database design. In addition, database constraints have to be not only satisfiable but also finitely satisfiable. This problem is generally addressed by using theorem provers that, being developed for first order logic formulas, are based on semidecidable procedures. Furthermore, even in simple cases, theorem provers are quite inefficient in dealing with comparison operators such as, for instance, the equality. In this paper, a decidable, sound, and complete method for checking finite satisfiability of a specific class of integrity constraints for object-oriented databases, including the equality constraints, is presented. The method, that is based on a graph-theoretic approach, has exponential complexity in the worst case, rarely occurring in practice.

Inheritance is introducted in object-oriented systems to enhance code reuse and create more compact and readable software. Powerful object models adopt multiple inheritance, allowing a type (or class) definition to inherit from more than one supertype. Unfortunately, in applying this powerful modeling mechanism, inheritance conflicts may be generated, which arise when the same property or operation is defined in more than one supertype. Inheritance conflicts identification and resolution is the key issue of this article. In strongly typed object-oriented systems the resolutioin of inheritance conflicts depends on the compatibility of the types of the conflicting definitions. In case of incompatible types, a contradiction arises. This article focuses on object-oriented databases (ODBs), providing a method aimed at supporting the designer in the construction of correct ODB schemas. The first necessary condition for schema correctness is the absence of contradictions. A second cause of schema incorrectness is due to the presence of structurally recursive types that, when defined within certain hierarchical patterns, cause the nontermination of the inheritance process. In the article, after the formal definition of a correct schema, two graph-theoretic methods aimed at verifying ODB schema correctness are analyzed. Although the first method is intuitive but inefficient, the second allows schema correctness to be checked in polynomial time, in the size of the schema. The results of this study are included in the implementation of Mosaico, an environment for ODB application design.