Formula dissection: A parallel algorithm for constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Formula dissection: A parallel algorithm for constraint satisfaction
Many well-known problems in Artificial Intelligence can be formulated in terms of systems of constraints. The problem of testing the satisfiability of propositional formulae (SAT) is of special importance due to its numerous applications in theoretical computer science and Artificial Intelligence. A brute-force algorithm for SAT will have exponential time complexity O(), where n is the number ...
متن کاملDesign and Implementation of a Parallel Constraint Satisfaction Algorithm
Constraint satisfaction techniques are often applied in areas like design, diagnosis, truth maintenance and scheduling. This paper describes the design and implementation of a parallel constraint satisfaction algorithm for the special application, qualitative simulation. In qualitative simulation, constraint satisfaction problems (CSPs) must be solved very often, and furthermore, solving the CS...
متن کاملParallel Hardware for Constraint Satisfaction
A parallel implementation of constraint satisfaction by arc consistency is presented. The implementation is constructed of standard digital hardware elements, used in a very fine-grained, massively parallel style. As an example of how to specialize the design, a parallel implementation for solving graph isomorphism with arc consistency is also given. Complexity analyses are given for both circu...
متن کاملA Parallel Architecture for Constraint Satisfaction
The Constraint Satisfaction Problem (CSP) has been a useful model for various industrial and engineering applications. These include image processing and pattern recognition, VLSI engineering, robotics manipulation, and computer hardware design automation. In this paper , we give a novel AI architecture for discrete relaxation that eeectively prunes a backtracking search tree in CSP. This algor...
متن کاملFast Parallel Constraint Satisfaction
Kirousis, L.M., Fast parallel constraint satisfaction (Research Note), Artificial Intelligence 64 (1993) 147-160. We describe a class of constraint satisfaction problems (CSPs) for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work on this class of CSPs. The result is motivated from the problem of labelling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2008
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.07.002