This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...