This paper presents some ideas on using paraconsistent logics to represent and to reason about knowledge in distributed systems. Since one our main research areas is related to robotics and manufacturing systems, we focus our attention on logics and problems relevant to this area. We review the fundamental concepts deening paraconsistency and overcompleteness in non-classical logics and how these concepts can be helpful for problem-solving in distributed systems, and propose a paraconsis-tent multiepistemic knowledge to model such systems. We also present, as an illustration, a paraconsistent reformulation of the well-known \muddy children problem" which we believe is relevant to automated manufacturing and robotics, and how this reformulated problem can be solved using the proposed logic.
[1]
V. S. Subrahmanian,et al.
Theory of Generalized Annotated Logic Programming and its Applications
,
1992,
J. Log. Program..
[2]
V. S. Subrahmanian,et al.
Relating Dempster-Shafer Theory to Stable Semantics
,
1991,
ISLP.
[3]
Towards Eecient Modelling of Distributed Knowledge Using Equational and Order-sorted Logic
,
1994
.
[4]
Joseph Y. Halpern,et al.
Knowledge, probability, and adversaries
,
1993,
JACM.
[5]
Joseph Y. Halpern,et al.
Modelling knowledge and action in distributed systems
,
1988,
Distributed Computing.
[6]
V. S. Subrahmanian.
On the Semantics of Quantitative Logic Programs
,
1987,
SLP.