Wyniki wyszukiwania - BazTech

1

A Non-Deterministic Multiset Query Language

Zieliński Bartosz

Fundamenta Informaticae

|

2021

|

Vol. 184, nr 2

141--180

EN

We develop a multiset query and update language executable in a term rewriting system. Its most remarkable feature, besides non-standard approach to quantification and introduction of fresh values, is non-determinism — a query result is not uniquely determined by the database. We argue that this feature is very useful, e.g., in modelling user choices during simulation or reachability analysis of a data-centric business process — the intended application of our work. Query evaluation is implemented by converting the query into a terminating term rewriting system and normalizing the initial term which encapsulates the current database. A normal form encapsulates a query result. We prove that our language can express any relational algebra query. Finally, we present a simple business process specification framework (and an example specification). Both syntax and semantics of our query language is implemented in Maude

2

A Query Language Based on Term Matching and Rewriting

Zieliński Bartosz

Fundamenta Informaticae

|

2019

|

Vol. 169, nr 3

237--274

EN

Recent years have seen the emergence of a data-centric approach to business process modelling as an attractive alternative to the dominant task-centric one. This new paradigm requires new tools for effective specification, simulation and validation of data-centric models. In particular, such tools must include support for expressive query and database update languages. Rewriting logic was proposed (and successfully used) as a generic framework for the specification of dynamic systems. However, though relational and other data models can be easily simulated, rewriting systems lack the direct support for first-order queries. In this paper we describe a novel condition and query language (at least as expressive as relational algebra), implemented in the term rewriting language Maude, together with a simple framework for relational transition system specification and simulation. The language is designed to be easy to implement on the top of a conditional rewriting system. Its most interesting feature is that it avoids all problems with variable binding. It works with models founded both on sets and multisets, and the language has linear-like facilities to refer to multiplicities of facts (in the case of multiset-founded models). As an example of the use of our language and simulation framework we reproduce some specifications of business processes from the literature. We also compare several methods for choosing the next action and its input during simulation.

3

A Formalism for the Description of Protein Interaction Dedicated to Jerzy Tiuryn on the Occasion of His Sixty Birthday

Barbuti R., Dezani-Ciancaglini M., Maggiolo-Schettini A., Milazzo P., Troina A.

Fundamenta Informaticae

|

2010

|

Vol. 103, nr 1-4

1-29

EN

The Calculus of Looping Sequences is a formalism for describing evolution of biological systems by means of term rewriting rules. We propose to enrich this calculus by labelling elements of sequences. Since two elements with the same label are considered to be linked, this allows us to represent protein interaction at the domain level. Well-formedness of terms are ensured by both a syntactic constraint and a type system: we discuss the differences between these approaches through the description of a biological system, namely the EGF pathway.

4

A Rewriting Framework for Rule-Based Programming Dynamic Applications

Doroshenko A., Shevchenko R.

Fundamenta Informaticae

|

2006

|

Vol. 72, nr 1-3

95-108

EN

In recent years light-weighted formal methods in construction and analysis of complex concurrent software system are of growing interest. In this paper a new rule-action based term rewriting framework, called TermWare, is proposed and its application to software system analysis is described to provide better cost effectiveness of software maintenance under varied requirements and specifications of operation. The main advantage is light-weighted formal model based on not computational semantics but on particular properties of software system to be analyzed. Such approach eliminates the need in full formal analysis of software system and allows extreme flexibility of applications in two major concerns: high adaptability to changeable environment and easy reengineering and component reuse. The language and formal semantics of the system are defined. A new semantic model, called term system with action, is proposed for TermWare. A case study with some representative examples in source code analysis and software development with TermWare framework is presented.

5

Applying term rewriting to partial algebra theory

Dojer N.

Fundamenta Informaticae

|

2004

|

Vol. 63, nr 4

375--384

EN

In our paper we apply term rewriting to decidability of equations in classes of partial algebras, as well as to embeddability of partial algebras into classes of total ones. We follow the approach to partial algebras introduced by H.-J. Kreowski in [13], in which (classes of) partial algebras are described by means of (classes of) total ones.

6

Combining Clifford algebraic computing and term-rewriting for geometric theorem proving

Fevre S., Wang D.

Fundamenta Informaticae

|

1999

|

Vol. 39, Nr 1,2

85-104

EN

A general approach we have proposed for automatically proving geometric theorems requires both Clifford algebraic reduction and term-rewriting. This paper shows how efficient techniques and software tools developed in the areas of algebraic computation and term-rewriting can be combined for our purpose of theorem proving in geometry. Some investigations and experiments for concrete cases have been carried out by combining routines implemented in Maple V and Objective Caml. The experiments together with several examples illustrate the suitability and performance of our approach.