We present an architecture for scientific document retrieval. An existing system for textual and math-ware retrieval Math Indexer and Searcher MIaS is designed for extensions by modules for textual and math-aware entailment. The goal is to increase quality of retrieval (precision and recall) by handling natural languge variations of expressing semantically the same in texts and/or formulae. Ent...

This thesis takes an algorithmic perspective on the correspondence between modal and hybrid logics on the one hand, and first-order logic on the other. The canonicity of formulae, and by implication the completeness of logics, is simultaneously treated. Modal formulae define second-order conditions on frames which, in some cases, are equivalently reducible to first-order conditions. Modal formu...

Semantic collision is inevitable while building a domain ontology fromheterogeneous data sources (semi-)automatically.Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology f...

Semantic coordination, namely the problem of finding an agreement on the meaning of heterogeneous semantic models, is one of the key issues in the development of the Semantic Web. In this paper, we propose a new algorithm for discovering semantic mappings across hierarchical classifications based on a new approach to semantic coordination. This approach shifts the problem of semantic coordinati...

We examine a commercial application, a large portion of whose domain knowledge is taxonomic in nature, and investigate the suit-ability of inheritance networks for the task of reasoning about knowledge in this area. We claim that standard inheritance networks are not suuciently expressive to capture domain knowledge, and introduce formula-augmented semantic networks (FANs), a semantic network w...

A b s t r a c t . We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL formulae, and uses symbolic manipulation cilgorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming),...

Self-organising Logic of Structures (SLS), a semantic representation language of high expressive power, seems attractive from a theoretical point of view. To check its usefulness for natural language understanding systems, an implementation is required. This article presents our e orts aimed at computational veri cation of SLS. We discuss some computational problems and propose a solution based...

Paper discusses the needs for data normalization in a Digital Mathematics Library (DML). Specifically, emphasis is given to canonicalizing formulae encoded in Presentation MathML notation which starts to be available in several DMLs and is used by DML applications. This is a prerequisite for advanced processing—namely math enabled fulltext searching or semantic filtering and automated classific...

We introduce the Declaratron, a system which takes a declarative approach to specifying mathematically based scientific computation. This uses displayable mathematical notation (Content MathML) and is both executable and semantically well defined. We combine domain specific representations of physical science (e.g. CML, Chemical Markup Language), MathML formulae and computational specifications...

The buckling torque may be much less than the yield torque in very thin rectangular tubes under torsion. In this paper, simple closed-form formulae are presented for buckling analysis of long hollow rectangular tubes under torsion. By the presented formulae, one can obtain the critical torque or the critical angle of twist of the tube in terms of its geometrical parameters and material constant...