Transaction support is vital for reliability of business processes which nowadays can involve dynamically composed services across organizational boundaries. However, no single transaction model is comprehensive enough to accommodate various transactional properties demanded by those processes. Therefore we develop the Business Transaction Framework, which is based on Abstract Transactional Con...

Defeasible argumentation is one of the approaches that attempt to address the challenges arising when we reason defeasibly, with several formalisms in the literature reaching a mature state. Nowadays, several of them started shifting their semantics towards a dialectical characterization. Therefore, we believe that a sufficiently generic model of the process of dialectical reasoning could also ...

Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Within the field of Logic Programming, most of the implementations of Prolog and its variants are based on an abstract machine defined by D. Warren (nowadays known as...

Automating the composition of web services is an object of a growing interest nowadays. In our former paper [3] we proposed a method for converting the problem of the composition to the problem of building a graph of worlds consisting of formally defined objects, and presented the first phase of this composition resulting in building a graph of types of services (an abstract graph). In this wor...

The aim of this paper is to dene the abstract domain, abstract operator, abstract semantic, the environments and states of disassembled executable codes as well as a way to analysis the disassembled executable codes. Nowadays, static analysis on disassembled code going to grow. Reverse engineering and malware analysis use this technique. Thus, we tried to perform pluralization the requirements ...

0