Ricerc@Sapienza

The Semantic Web is commonly interpreted under the open-world assumption meaning that information available (e.g., in a data source) only captures a subset of the reality. Therefore, there is no certainty about whether the available information provides a complete representation of the reality. The broad aim of this paper is to contribute a formal study of how to describe the completeness of parts of the Semantic Web stored in RDF data sources. We introduce a theoretical framework allowing to augment RDF data sources with statements, also expressed in RDF, about their completeness.

Business process compliance checking enables organisations to assess whether their processes fulfil a given set of constraints, such as regulations, laws, or guidelines. Whilst many process analysts still rely on ad-hoc, often handcrafted per-case checks, a variety of constraint languages and approaches have been developed in recent years to provide automated compliance checking. A salient example is Declare, a well-established declarative process specification language based on temporal logics.

Modern software applications increasingly benefit from accessing the multifarious and heterogeneous Web of Data, thanks to the use of web APIs and Linked Data principles. In previous work, the authors proposed a platform to develop applications consuming Linked Data in a declarative and modular way. This paper describes in detail the functional language the platform gives access to, which is based on SPARQL (the standard query language for Linked Data) and on the dataflow paradigm.