Goto

Collaborating Authors

 Ontologies


SMT-Based Safety Verification of Data-Aware Processes under Ontologies (Extended Version)

arXiv.org Artificial Intelligence

In the context of verification of data-aware processes (DAPs), a formal approach based on satisfiability modulo theories (SMT) has been considered to verify parameterised safety properties of so-called artifact-centric systems. This approach requires a combination of model-theoretic notions and algorithmic techniques based on backward reachability. We introduce here a variant of one of the most investigated models in this spectrum, namely simple artifact systems (SASs), where, instead of managing a database, we operate over a description logic (DL) ontology expressed in (a slight extension of) RDFS. This DL, enjoying suitable model-theoretic properties, allows us to define DL-based SASs to which backward reachability can still be applied, leading to decidability in PSPACE of the corresponding safety problems.


Pinaki Laskar on LinkedIn: #Artificialintelligence #algorithms #ontology

#artificialintelligence

AI Researcher, Cognitive Technologist Inventor - AI Thinking, Think Chain Innovator - AIOT, XAI, Autonomous Cars, IIOT Founder Fisheyebox Spatial Computing Savant, Transformative Leader, Industry X.0 Practitioner AI first originated from Aristotle's Analytics, Prior and Posterior, Metaphysics/Ontology and Categories. Without Categories, no real AI/ML/DL classifiers with effective classification #algorithms are possible, where classes are targets, labels or categories. Classification predictive modeling is NOT just the task of approximating a mapping function (f) from input variables (X) to discrete output variables (y). It is about the data #ontology/causality and logic/model, semantics and syntax and pragmatics, or comprehensive machine understanding of its data points, elements, sets, patterns and relationships. Aristotle, who identified intuition and logic as being the two aspects of the mind that attain knowledge. However, before the computer, logic became preferred over intuition for its rigor and certainty, which allows logical reasoning to be formally studied and ultimately automated.


An Internet of Things Service Roadmap

Communications of the ACM

The Internet of things (IoT) is taking the world by storm, thanks to the proliferation of sensors and actuators embedded in everyday things, coupled with the wide availability of high-speed Internet50 and evolution of the 5th-generation (5G) networks.34 IoT devices are increasingly supplying information about the physical environment (for example, infrastructure, assets, homes, and cars). The advent of IoT is enabling not only the connection and integration of devices that monitor physical world phenomena (for example, temperature, pollution, energy consumption, human activities, and movement), but also data-driven and AI-augmented intelligence. At all levels, synergies from advances in IoT, data analytics, and artificial intelligence (AI) are firmly recognized as strategic priorities for digital transformation.10,41,50 IoT poses two key challenges:36 Communication with things and management of things.41 The service paradigm is a key mechanism to overcome these challenges by transforming IoT devices into IoT services, where they will be treated as first-class objects through the prism of services.9 In a nutshell, services are at a higher level of abstraction than data. Services descriptions consist of two parts: functional and non-functional, such as, Quality of Service (QoS) attributes.27 Services often transform data into an actionable knowledge or achieve physical state changes in the operating context.9 As a result, the service paradigm is the perfect basis for understanding the transformation of data into actionable knowledge, that is, making it useful. Despite the increasing uptake of IoT services, most organizations have not yet mastered the requisite knowledge, skills, or understanding to craft a successful IoT strategy.


QDEF and Its Approximations in OBDM

arXiv.org Artificial Intelligence

Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to find a query over the ontology whose certain answers coincide with the tuples in the given dataset. We refer to such a query as a characterization of the dataset with respect to the OBDM system. Our first contribution is to propose approximations of perfect characterizations in terms of recall (complete characterizations) and precision (sound characterizations). A second contribution is to present a thorough complexity analysis of three computational problems, namely verification (check whether a given query is a perfect, or an approximated characterization of a given dataset), existence (check whether a perfect, or a best approximated characterization of a given dataset exists), and computation (compute a perfect, or best approximated characterization of a given dataset).


InBiodiv-O: An Ontology for Indian Biodiversity Knowledge Management

arXiv.org Artificial Intelligence

To present the biodiversity information, a semantic model is required that connects all kinds of data about living creatures and their habitats. The model must be able to encode human knowledge for machines to be understood. Ontology offers the richest machine-interpretable (rather than just machine-processable) and explicit semantics that are being extensively used in the biodiversity domain. Various ontologies are developed for the biodiversity domain however a review of the current landscape shows that these ontologies are not capable to define the Indian biodiversity information though India is one of the megadiverse countries. To semantically analyze the Indian biodiversity information, it is crucial to build an ontology that describes all the essential terms of this domain from the unstructured format of the data available on the web. Since, the curation of the ontologies heavily depends on the domain where these are implemented hence there is no ideal methodology is defined yet to be ready for universal use. The aim of this article is to develop an ontology that semantically encodes all the terms of Indian biodiversity information in all its dimensions based on the proposed methodology. The comprehensive evaluation of the proposed ontology depicts that ontology is well built in the specified domain.


Creating and Querying Personalized Versions of Wikidata on a Laptop

arXiv.org Artificial Intelligence

Application developers today have three choices for exploiting the knowledge present in Wikidata: they can download the Wikidata dumps in JSON or RDF format, they can use the Wikidata API to get data about individual entities, or they can use the Wikidata SPARQL endpoint. None of these methods can support complex, yet common, query use cases, such as retrieval of large amounts of data or aggregations over large fractions of Wikidata. This paper introduces KGTK Kypher, a query language and processor that allows users to create personalized variants of Wikidata on a laptop. We present several use cases that illustrate the types of analyses that Kypher enables users to run on the full Wikidata KG on a laptop, combining data from external resources such as DBpedia. The Kypher queries for these use cases run much faster on a laptop than the equivalent SPARQL queries on a Wikidata clone running on a powerful server with 24h time-out limits.


MigrationsKB: A Knowledge Base of Public Attitudes towards Migrations and their Driving Factors

arXiv.org Artificial Intelligence

With the increasing trend in the topic of migration in Europe, the public is now more engaged in expressing their opinions through various platforms such as Twitter. Understanding the online discourses is therefore essential to capture the public opinion. The goal of this study is the analysis of social media platform to quantify public attitudes towards migrations and the identification of different factors causing these attitudes. The tweets spanning from 2013 to Jul-2021 in the European countries which are hosts to immigrants are collected, pre-processed, and filtered using advanced topic modeling technique. BERT-based entity linking and sentiment analysis, and attention-based hate speech detection are performed to annotate the curated tweets. Moreover, the external databases are used to identify the potential social and economic factors causing negative attitudes of the people about migration. To further promote research in the interdisciplinary fields of social science and computer science, the outcomes are integrated into a Knowledge Base (KB), i.e., MigrationsKB which significantly extends the existing models to take into account the public attitudes towards migrations and the economic indicators. This KB is made public using FAIR principles, which can be queried through SPARQL endpoint. Data dumps are made available on Zenodo.


Enterprise Architecture Model Transformation Engine

arXiv.org Artificial Intelligence

With increasing linkage within value chains, the IT systems of different companies are also being connected with each other. This enables the integration of services within the movement of Industry 4.0 in order to improve the quality and performance of the processes. Enterprise architecture models form the basis for this with a better buisness IT-alignment. However, the heterogeneity of the modeling frameworks and description languages makes a concatenation considerably difficult, especially differences in syntax, semantic and relations. Therefore, this paper presents a transformation engine to convert enterprise architecture models between several languages. We developed the first generic translation approach that is free of specific meta-modeling, which is flexible adaptable to arbitrary modeling languages. The transformation process is defined by various pattern matching techniques using a rule-based description language. It uses set theory and first-order logic for an intuitive description as a basis. The concept is practical evaluated using an example in the area of a large German IT-service provider. Anyhow, the approach is applicable between a wide range of enterprise architecture frameworks.


Development of the InBan_CIDO Ontology by Reusing the Concepts along with Detecting Overlapping Information

arXiv.org Artificial Intelligence

The covid19 pandemic is a global emergency that badly impacted the economies of various countries. Covid19 hit India when the growth rate of the country was at the lowest in the last 10 years. To semantically analyze the impact of this pandemic on the economy, it is curial to have an ontology. CIDO ontology is a well standardized ontology that is specially designed to assess the impact of coronavirus disease and utilize its results for future decision forecasting for the government, industry experts, and professionals in the field of various domains like research, medical advancement, technical innovative adoptions, and so on. However, this ontology does not analyze the impact of the Covid19 pandemic on the Indian banking sector. On the other side, Covid19IBO ontology has been developed to analyze the impact of the Covid19 pandemic on the Indian banking sector but this ontology does not reflect complete information of Covid19 data. Resultantly, users cannot get all the relevant information about Covid19 and its impact on the Indian economy. This article aims to extend the CIDO ontology to show the impact of Covid19 on the Indian economy sector by reusing the concepts from other data sources. We also provide a simplified schema matching approach that detects the overlapping information among the ontologies. The experimental analysis proves that the proposed approach has reasonable results.


The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard

arXiv.org Artificial Intelligence

In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest. For knowledge bases in the basic description logic ALC, the computational complexity of conjunctive query (CQ) answering is well known to be ExpTime-complete and hence not harder than satisfiability. This does not change when the logic is extended by certain features (such as counting or role hierarchies), whereas adding others (inverses, nominals or transitivity together with role-hierarchies) turns CQ answering exponentially harder. We contribute to this line of results by showing the surprising fact that even extending ALC by just the Self operator - which proved innocuous in many other contexts - increases the complexity of CQ entailment to 2ExpTime. As common for this type of problem, our proof establishes a reduction from alternating Turing machines running in exponential space, but several novel ideas and encoding tricks are required to make the approach work in that specific, restricted setting.