منابع مشابه
Arc consistency for factorable relations
An optimal arc consistency algorithm AC-4 was given by Mohr and Henderson [8]. AC4 has cost 0(ea), and cost (na) for scene labelling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. In this paper, we present conditions and mechanisms for such transformations, and show how to factor relations i...
متن کاملArc-Consistency and Arc-Consistency Again
There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often re...
متن کاملArc Consistency for Dynamic CSPs
Constraint Satisfaction problems (CSPs) are a fundamental concept used in many real world applications such as interpreting a visual image, laying out a silicon chip, frequency assignment, scheduling, planning and molecular biology. A main challenge when designing a CSP-based system is the ability to deal with constraints in a dynamic and evolutive environment. We talk then about on line CSP-ba...
متن کاملArc Consistency for Soft Constraints
The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes non idempotent operators such as + which define problems which are very important in practical app...
متن کاملArc-Consistency for Continuous Variables
Davis 1] has investigated the properties of the Waltz propagation algorithm with interval labels in continuous domains. He shows that in most cases, the algorithm does not achieve arc consistency, and furthermore is subject to innnite iterations. In this paper, I show that the main reason for Davis' negative results lies in the way he formulates the propagation rule for the Waltz algorithm. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1992
ISSN: 0004-3702
DOI: 10.1016/0004-3702(92)90077-b