Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,963
Some philosophical problems from the standpoint of artificial intelligence
- AI, IN MACHINE INTELLIGENCE 4, MELTZER AND MICHIE (EDS
, 1969
"... ..."
The Drinking Philosophers Problem
- ACM Transactions on Programming Languages and Systems
, 1984
"... The problem of resolving conflicts between processes in distributed systems is of practical importance. A conflict between a set of processes must be resolved in favor of some (usually one) process and against the others: a favored process must have some property that distinguishes it from others. T ..."
Abstract
-
Cited by 160 (4 self)
- Add to MetaCart
. A simple conflict resolution rule coupled with the acyclic graph ensures fair resolution of all conflicts. To make the problem concrete, two paradigms are presented: the well-known distributed dining philosophers problem and a generalization of it, the distributed drinking philosophers problem.
The evolving philosophers problem: dynamic change management
- IEEE Trans Softw Eng
, 1990
"... Abstract-One of the major challenges in the provision of distributed systems is the accommodation of evolutionary change. This may involve modifications or extensions to the system which were not envisaged at design time. Furthermore, in many application domains there is a requirement that the syste ..."
Abstract
-
Cited by 332 (17 self)
- Add to MetaCart
knowledge of the actual structural changes which may be introduced. In addition, the changes can be applied in such a way as to leave the modified system in a consistent state, and cause no disturbance to the unaffected part of the operational system. The model is applied to an example problem, “evolving
On the Generalized Dining Philosophers Problem
, 2001
"... We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We
5 Hungry philosophers ’ problem.
"... Abstract: The management of shared resources in the systems sensitive to time is tried to be analyzed in multy-agent environment – JADE. As a model for that “5 hungry philosophers” problem (firstly formulated by Deikstra) [1] was taken to be investigated. This article shows how this model can be rep ..."
Abstract
- Add to MetaCart
Abstract: The management of shared resources in the systems sensitive to time is tried to be analyzed in multy-agent environment – JADE. As a model for that “5 hungry philosophers” problem (firstly formulated by Deikstra) [1] was taken to be investigated. This article shows how this model can
The Congenial Talking Philosophers Problem in
- In Proceedings of the 13th International Symposium on DIStributed Computing (DISC'99
, 1999
"... Yuh-Jzer Joung joung@ccms.ntu.edu.tw Department of Information Management National Taiwan University Taipei, Taiwan Abstract. The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been pro ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Yuh-Jzer Joung joung@ccms.ntu.edu.tw Department of Information Management National Taiwan University Taipei, Taiwan Abstract. The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been
Ten philosophical problems in deontic logic
- Normative Multi-agent Systems, volume 07122 of Dagstuhl Seminar Proceedings. Internationales Begegnungsund Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl
, 2007
"... Abstract. The paper discusses ten philosophical problems in deontic logic: how to formally represent norms, when a set of norms may be termed ‘coherent’, how to deal with normative conflicts, how contraryto-duty obligations can be appropriately modeled, how dyadic deontic operators may be redefined ..."
Abstract
-
Cited by 17 (7 self)
- Add to MetaCart
Abstract. The paper discusses ten philosophical problems in deontic logic: how to formally represent norms, when a set of norms may be termed ‘coherent’, how to deal with normative conflicts, how contraryto-duty obligations can be appropriately modeled, how dyadic deontic operators may be redefined
Ten philosophical problems in belief revision
- Journal of Logic and Computation
, 2003
"... The paper introduces ten open problems in belief revision theory, related to the representation of the belief state, to different notions of degrees of belief, and to the nature of change operations. It is argued that these problems are all issues in philosopical logic, in the strong sense of requir ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
The paper introduces ten open problems in belief revision theory, related to the representation of the belief state, to different notions of degrees of belief, and to the nature of change operations. It is argued that these problems are all issues in philosopical logic, in the strong sense
A Distributed Algorithm in Agda: The Dining Philosophers Problem
, 1999
"... One distributed algorithm for the dining philosophers problem [1] is implemented in Agda, a proof checker based on Martin-Lof's type theory. The correctness proof of the algorithm is outlined and the difficulties are discussed. ..."
Abstract
- Add to MetaCart
One distributed algorithm for the dining philosophers problem [1] is implemented in Agda, a proof checker based on Martin-Lof's type theory. The correctness proof of the algorithm is outlined and the difficulties are discussed.
Results 1 - 10
of
2,963
