Web Service is one of the most important information sharing technologies on the web and one of the example of service oriented processing. To guarantee accurate execution of web services operations, they must be accountable with regulations of the social networks in which they sign up. This operations implement using controls called “Commitment”. This paper studies commitments , then has an ov...

In this paper we develop a semantics of our approach based on commitments and arguments for conversational agents. We propose a logical model based on CTL* (Extended Computation Tree Logic) and on dynamic logic. Called Commitment and Argument Network (CAN), our formal framework based on this hybrid approach uses three basic elements: social commitments, actions that agents apply to these commit...

Despite their dynamic nature, social commitments have been rarely used for monitoring purposes, and few attention has been paid to the relationship between commitments and the temporal dimension and to the corresponding run-time verification. Building on previous work, we present a declarative axiomatization of time-aware social commitments, extending their basic life cycle with time-related tr...

With the rapid advancement of e-service technology, there is a need to manage business relationships among business entities such as service providers, service consumers, and internal departments. In this paper, we have proposed a novel approach to business relationship management using business commitments and associated business commitment hubs. Business commitments are commitments related to...

Web Service is one of the most significant current discussions in information sharing technologies and one of the examples of service oriented processing. To ensure accurate execution of web services operations, it must be adaptable with policies of the social networks in which it signs up. This adaptation implements using controls called “Commitment”. This paper describes commitments structure...

We propose Cupid, a language for specifying commitments that supports their information-centric aspects, and offers crucial benefits. One, Cupid is first-order, enabling a systematic treatment of commitment instances. Two, Cupid supports features needed for real-world scenarios such as deadlines, nested commitments, and complex event expressions for capturing the lifecycle of commitment instanc...

Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel (or concurrently) and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret. We prove the follo...

The problem addressed in this paper is the supply chain reactivity assessment through numerical experimentations regarding specifically two negotiated commitments within supply contract: the frozen horizon and flexibility rate. Analysis of impact of these commitments on each partner will be depicted in term of storage costs, reliability and reactivity indicators. The decision making inside each...

Cooperative-problem-solving negotiations in competitive environments involve an initial conclusion of commitments as well as their possible adaptations during their execution. Conclusion of commitments, breaching the commitments (decommitments), their replanning and reconfiguration introduce means of achieving flexibility in cooperation among self-interested agents and require adequate negotiat...

During the development of a system, software modules can be viewed in terms of their commitments: the constraints imposed by their own structure and behavior, and by their relationships with other modules (in terms of resource consumption, data requirements, etc.). The Comet system uses explicit representation and reasoning with commitments to aid the software design and development process { i...