GAC on Conjunctions of Constraints
نویسندگان
چکیده
Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be useful to conjoin. The result is a useful automatic way of improving a CSP model for GAC solving.
منابع مشابه
An Efficient Higher-Order Consistency Algorithm for Table Constraints
Table constraints are very important in constraint programming as they are present in many real problems from areas such as configuration and databases. As a result, numerous specialized algorithms that achieve generalized arc consistency (GAC) on table constraints have been proposed. Since these algorithms achieve GAC, they operate on one constraint at a time. In this paper we propose an effic...
متن کاملInvestigating the Use of Paratactic and Hypotactic Conjunctions among Iranian Pre-university Students
In an attempt to dispel the persisting fallacy that an individual’s grammar knowledge is indicative of the way they put this knowledge into practice, this study seeks to highlight the inconsistency which resides between one’s competence and performance in the domain of conjunctions. It aims to shed light on the discrepancy which lies between the knowledge and production of conjunctions. The res...
متن کاملMaking Simple Tabular ReductionWorks on Negative Table Constraints
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a cer...
متن کاملGAC Via Unit Propagation
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a clausal theory encoding the constraint. This approach to GAC offers a number of advantages over the traditional approach of designing constraint specific algorithms (propagators). Most importantly, it is easier to impl...
متن کاملExtending Generalized Arc Consistency
Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any constraint, have been proposed in the literature. Stronger local consistencies than GAC have also been studied but algorithms for such consistencies are generally considered too expensive. In...
متن کامل