Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
نویسنده
چکیده
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. Several consistency algorithms have exponential complexity in the CSP’s arity, others only work on low
منابع مشابه
Consistency Techniques for Numeric CSPs
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the consistency techniques that have been developed for CSPs can be adapted to numeric CSPs. Since the numeric domains are ordered the underlying idea is to handle domains only by their bounds. The semantics that have bee...
متن کاملA New Heuristics to Solve Temporal Constraint Satisfaction Problem Using Entropy and Convexity
The temporal constraint satisfaction problem based on Allen’s interval algebra is a very widely studied model for temporal reasoning. Since the problem is established to be NPcomplete, the research directions are mainly concerned with finding different tractable subclasses or, devising different heuristic to solve the general problem. In this paper we propose new heuristic strategies to determi...
متن کاملCoping With Disjunctions in Temporal Constraint Satisfaction Problems
Path-consistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomial algorithm, called ULT, that approximates path-consistency in Temporal Constraint Satisfaction P...
متن کاملOrdering Heuristics for Arc Consistency Algorithms
Arc consistency algorithms are used in solving constraint satisfaction problems and are important in constraint logic programming languages. Search order heuristics for arc consistency algorithms signiicantly enhance the ef-ciency of their implementation. In this paper we propose and evaluate several ordering heuristics. Care is taken with experimental design , involving random problems, and st...
متن کاملProcessing Temporal Constraint Networks
This paper describes new algorithms for processing quantitative and qualitative Temporal Constraint Satisfaction Problems (TCSP). In contrast to discrete Constraint Satisfaction Problems (CSP), enforcing path-consistency on quantitative TCSP is exponential, due to the fragmentation problem. Identifying the fragmentation problem allows us to design several e cient polynomial algorithms that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999