Work

An asynchronous, message-efficient, distributed algorithm for enforcing partial consistency in information networks

Year: 2026

Type: article

Abstract: In this work we present a totally asynchronous distributed algorithm for the problem of achieving arc-consistency in a network of constraints. The algorithm is designed for multicomputer systems. Since the number and size of messages are two factors of major concern when solving a problem distributively we have paid particular attention to designing the algorithm in a way that tends to reduce their number and size. Our approach relies on identifying whether a message can be suppressed without affecting the operation of theprocess to which it was addressed. This has the effect of keeping the number of exchanged messages low at a cost of some small extra computation time.

Source: Journal of Discrete Mathematical Sciences and Cryptography

DOI: 10.47974/jdmsc-2583

Authors: Hera Antonopoulou, Dimitris Papadopoulos, Yannis C. Stamatiou

Institutions: University of Patras, Computer Technology Institute and Press “DIOPHANTUS”

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W7135398751

FWCI:

Cites:

Cited by:

Related to: 10