Towards a Foundation for XML Document Databases

Anutariya, Chutiporn; Wuwongse, Vilas; Nantajeewarawat, Ekawit; Akama, Kiyoshi

doi:10.1007/3-540-44463-7_28

Cited by 15 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, common and widely used concepts such as attributes and links in DTD are not modeled by the approach. In the research presented by Anutariya [2], a formal framework for XML documents, called the XML declarative description (XML-DD) model, is developed using declarative description theory for modeling and managing XML documents. The XML-DD is developed by characterizing XML elements in terms of mathematical structures called a specialization system, where a formal representation and reasoning support are constructed accordingly.…”

Section: Formal Semantics Of Semistructured Datamentioning

confidence: 99%

“…This paper is a substantial extension of our previous work on validating ORA-SS data models [27]. The extension includes-(1) formal criteria for measuring the correctness of semistructured data normalization; (2) semantic encoding of the proposed correctness criteria in PVS; (3) automated verification of ORA-SS data normalization using the PVS theorem prover. As a Fig.…”

Section: Introductionmentioning

confidence: 99%

“…In order to provide formal validation for schema and data instances and formal verification for the normalization, an adequate data modeling language for semistructured data and formal specification and verification languages must be selected [2,5,9,14]. The former should represent the schema of semistructured data, since the normalization algorithms transform the schema of the data.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Theorem prover approach to semistructured data design

Lee

Dobbie

Sun

et al. 2010

Form Methods Syst Des

View full text Add to dashboard Cite

The wide adoption of semistructured data has created a growing need for effective ways to ensure the correctness of its organization. One effective way to achieve this goal is through formal specification and automated verification. This paper presents a theorem proving approach towards verifying that a particular design or organization of semistructured data is correct. We formally specify the semantics of the Object Relationship Attribute data model for Semistructured Data (ORA-SS) modeling notation and its correctness criteria for semistructured data normalization using the Prototype Verification System (PVS). The result is that effective verification on semistructured data models and their normalization can be carried out using the PVS theorem prover.

show abstract

Section: Formal Semantics Of Semistructured Datamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Theorem prover approach to semistructured data design

Lee

Dobbie

Sun

et al. 2010

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…Based on the theory of the Extensible Markup Language (XML) declarative descriptions, 5,6 this study proposes a solid practical framework for knowledge representation and reasoning in the domain of UML. In this framework, UML diagrams will be represented as textual structured data in XML, 7 and the general knowledge about the UML domain as an XML declarative description.…”

Section: Introductionmentioning

confidence: 99%

Toward reasoning with unified modeling language diagrams based on extensible markup language declarative description theory

Nantajeewarawat¹,

Wuwongse²,

Anutariya³

et al. 2004

Int. J. Intell. Syst.

Self Cite

View full text Add to dashboard Cite

A practical framework for representing knowledge and reasoning in the domain of Unified Modeling Language (UML) is proposed. In this framework, graphical diagrams in a UML model are encoded as Extensible Markup Language (XML)/Metadata Interchange (XMI) elements, which are regarded as facts about a specific problem instance in a knowledge base, and the general knowledge on UML, such as inherent interrelationships among diagram components and implicit properties of diagrams, is represented as a set of XML definite clauses. Equivalent transformation (ET) is used as a fundamental computation mechanism for reasoning with the represented diagrams.

show abstract

“…For example, Calvanese et al [6] presents a formalization of XML DTD and documents in terms of an expressive description logic. Anutariya et al [1] formalizes XML DTD and documents in XML declarative description, a theoretical framework developed from declarative description theory. Conforti and Ghelli [7] introduces spatial tree logics, a language based on ambient logic, as formalisms for semistructured data.…”

Section: Introductionmentioning

confidence: 99%