A Vernacular for Coherent Logic

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.Comment: CICM 2014 - Conferences on Intelligent Computer Mathematics (2014

Comparative Analysis of XML Schema Languages for Improved Entropy Metric

The eXtensible Markup Language (XML) is a data set to represent data in a format that is both human readable and machine readable. For XML documents to provide understanding about data exchange between applications, XML schema documents should be validated against the schema language. Most existing schema metrics were implemented differently in Document Type Definition (DTD), XML Schema Definition (XSD) and Regular Language for Next Generation (RNG) but never compare XML schema languages on any metric. Hence this paper compared three different schema languages on Improved Entropy Metric (IEM) using the Number of Attributes (NA), Number of Equivalence Class (NEC), Frequency Occurrence of Class (FOCi) and Number of Elements (NE). The proposed metric was applied on real schemas documents data are acquired from Web Service Description Language (WSDL) and implemented in DTD, XSD and RNG. The result showed that RNG reduce complexity of class elements, reflect strong support for class elements to appear in any order which showed more reusability and flexibility traits and overall understanding of the schema documents becomes much easier because RNG can be algorithmically converted and partner with other schema languages therefore this reduces maintenance effort. Keywords— XML Schema Language, Schema Documents, Schema Metric

Evaluation and Comparison of Metrics for XML Schema Languages

The importance of XML (eXtensible Markup Language) can’t be understated; their usefulness may range from data sharing to data transport in software systems. Schema languages describe the structure of an XML document and the common schemas languages are Document Definition Type (DTD), W3C XML Schema and RelaxNG. Applications depend heavily on XML documents to be free of error and this makes it imperative to determine the quality of such schema document. Schema metrics is used to achieve this, and several of them have been proposed in recent years. In this paper we present the existing schema metrics and to make comparative studies on all schema metrics, figuring out the features, advantages and limitations of each metrics

XML Matchers: approaches and challenges

Schema Matching, i.e. the process of discovering semantic correspondences between concepts adopted in different data source schemas, has been a key topic in Database and Artificial Intelligence research areas for many years. In the past, it was largely investigated especially for classical database models (e.g., E/R schemas, relational databases, etc.). However, in the latest years, the widespread adoption of XML in the most disparate application fields pushed a growing number of researchers to design XML-specific Schema Matching approaches, called XML Matchers, aiming at finding semantic matchings between concepts defined in DTDs and XSDs. XML Matchers do not just take well-known techniques originally designed for other data models and apply them on DTDs/XSDs, but they exploit specific XML features (e.g., the hierarchical structure of a DTD/XSD) to improve the performance of the Schema Matching process. The design of XML Matchers is currently a well-established research area. The main goal of this paper is to provide a detailed description and classification of XML Matchers. We first describe to what extent the specificities of DTDs/XSDs impact on the Schema Matching task. Then we introduce a template, called XML Matcher Template, that describes the main components of an XML Matcher, their role and behavior. We illustrate how each of these components has been implemented in some popular XML Matchers. We consider our XML Matcher Template as the baseline for objectively comparing approaches that, at first glance, might appear as unrelated. The introduction of this template can be useful in the design of future XML Matchers. Finally, we analyze commercial tools implementing XML Matchers and introduce two challenging issues strictly related to this topic, namely XML source clustering and uncertainty management in XML Matchers.Comment: 34 pages, 8 tables, 7 figure

Creating XML Schemas for Lexicographical Projects: the Case of the Dictionary of the Slovene Literary Language of the 16th Century

The article discusses the strategies applied for creating XML Schemas in dictionary projects, based on experience gained during creation of the schema of the Dictionary of the Slovene Literary Language of the 16th Century, and it explains how the different possibilities of the construction of XML Schemas influence the lexicographical work and the subsequent use of the dictionary. Three general aspects to be considered in designing schemas for dictionary projects are described in the article: the content aspect, the practical aspect, and the technical aspect. On this basis, the decision on the formal description method of the structure in a given schema definition language is made and justified