Reasoning in multi-agent systems with random knowledge distribution

Authors:
Dominik Ryżko
Affiliations:
Institute of Computer Science, Warsaw University of Technology, Poland
Venue:
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Year:
2012

Citing 12
Cited 0

An improved parallel algorithm that computes the BFS numbering of a directed graph

Information Processing Letters
Faster optimal parallel prefix sums and list ranking

Information and Computation
A directly cautious theory of defeasible consequence for default logic via the notion of general extension

Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning

Artificial Intelligence
From logic programming towards multi-agent systems

Annals of Mathematics and Artificial Intelligence
Reasoning with Stratified Default Theories

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Knowledge sharing in default reasoning based multi-agent systems

IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Finding strongly connected components in distributed graphs

Journal of Parallel and Distributed Computing
Distributed Default Logic for Multi-agent System

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Social Default Theories

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Partition-based logical reasoning for first-order and propositional theories

Artificial Intelligence - Special volume on reformulation
About agents that reason by case (preliminary report)

IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents novel approach to distributed reasoning in a multi-agent systems with random knowledge distribution. The approach is based on a Distributed Default Logic (DDL) formalism, however can be directly applied to any other logic, which is subject to startification. The problem of finding strata is transformed into the problem of finding Strongly Connected Components (SCC) of a directed graph and solved by means of a distributed algorithm.