Showing 1 - 10 results of 10 for search '"semistructured data"', query time: 0.10s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    MODEL OF PROCESSING SEMI-STRUCTURED TEXT DATA IN RUSSIAN FOR INTELLECTUAL SUPPORT OF INFORMATION MANAGEMENT IN DYNAMIC ORGANIZATIONAL SYSTEMS by E.A. Makarova, D.G. Lagerev

    Published 2022-11-01
    “…The use of the proposed model makes it possible to reduce the expert's work time while maintaining the quality of semistructured data processing.…”
    Article
  6. 6

    On the Expressiveness of the Ambient Logic by Daniel Hirschkoff, Etienne Lozes, Davide Sangiorgi

    Published 2006-03-01
    “…The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. In this paper, we study the expressiveness of AL. …”
    Get full text
    Article
  7. 7

    Separability in the Ambient Logic by Daniel Hirschkoff, Etienne Lozes, Davide Sangiorgi

    Published 2008-09-01
    “…The \it{Ambient Logic} (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the discriminating power of AL, focusing on the equivalence on processes induced by the logic $(=_L>)$. …”
    Get full text
    Article
  8. 8

    XPath for DL ontologies by Kostylev, E, Reutter, J, Vrgoč, D

    Published 2015
    “…The latter is a powerful formalism for querying semistructured data: it is in the core of most practical query languages for XML trees, and it is also gaining popularity in theory and practice of graph databases. …”
    Conference item
  9. 9

    Proving Properties of Programs on Hierarchical Nominative Data by Ievgen Ivanov, Mykola Nikitchenko, Volodymyr G. Skobelev

    Published 2016-12-01
    “…Nominative data can be considered as a class of abstract data models which is able to represent many concrete types of structured and semistructured data that appear in programming. Thus, proofs of properties of programs depend on proofs of properties of compositions and basic operations on nominative data. …”
    Get full text
    Article
  10. 10