Authority in the Context of Distributed Knowledge

The notion of distributed knowledge is increasingly often invoked in discussions of economic organization. In particular, the claim that authority is inefficient as a means of coordination in the context of distributed knowledge has become widespread. However, very little analysis has been dedicated to the relation between economic organization and distributed knowledge. In this paper, we concentrate on the role of authority as a coordination mechanism under conditions of distributed knowledge, and also briefly discuss other issues of economic organization. We clarify the meanings of authority and distributed knowledge, and criticize the above claim by arguing that authority may be a superior mechanism of coordination under distributed knowledge. We also discuss how distributed knowledge influences the boundaries of firms. Our arguments rely on insights in problem-solving and on ideas from organizational economics.Distributed knowledge, existence of authority, problem-solving, the boundaries of the firm

Design reuse research : a computational perspective

This paper gives an overview of some computer based systems that focus on supporting engineering design reuse. Design reuse is considered here to reflect the utilisation of any knowledge gained from a design activity and not just past designs of artefacts. A design reuse process model, containing three main processes and six knowledge components, is used as a basis to identify the main areas of contribution from the systems. From this it can be concluded that while reuse libraries and design by reuse has received most attention, design for reuse, domain exploration and five of the other knowledge components lack research effort

Automated Negotiation for Provisioning Virtual Private Networks Using FIPA-Compliant Agents

This paper describes the design and implementation of negotiating agents for the task of provisioning virtual private networks. The agents and their interactions comply with the FIPA specification and they are implemented using the FIPA-OS agent framework. Particular attention is focused on the design and implementation of the negotiation algorithms

Programming in logic without logic programming

In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving force, and logic programs play only a supporting role. In the canonical model, states, actions and other events are represented with timestamps. But in the operational semantics, for the sake of efficiency, timestamps are omitted and only the current state is maintained. State transitions are performed reactively by executing actions to make the consequents of rules true whenever the antecedents become true. This operational semantics is sound, but incomplete. It cannot make reactive rules true by preventing their antecedents from becoming true, or by proactively making their consequents true before their antecedents become true. In this paper, we characterize the notion of reactive model, and prove that the operational semantics can generate all and only such models. In order to focus on the main issues, we omit the logic programming component of the framework.Comment: Under consideration in Theory and Practice of Logic Programming (TPLP

Constraint rule-based programming of norms for electronic institutions

Peer reviewedPostprin