Efficient constraint propagation engines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Techniques for Efficient Constraint Propagation

This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation. Support for incremental propagation is added to a propagatorcentered propagation system by adding a new intermediate layer of abstraction, advisors, that capture the essential asp...

متن کامل

Efficient Constraint Propagation for Graph Coloring

In this paper, we investigate constraint propagation, a mechanism that is run at each basic step of a backtrack search algorithm such as the popular MAC. From a statistical analysis of some relevant features concerning propagation on a large set of graph coloring instances, we show that it is possible to make reasonable predictions about the capability of constraint propagation to detect incons...

متن کامل

Programming Constraint Inference Engines

Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfortunate, since new engines cannot be integrated by the user. The paper presents first-class computation spaces as abstractions with which the user can program inference engines at a high level. Using computation spaces, the pape...

متن کامل

Off-line Constraint Propagation for Efficient HPSG Processing

We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a hpsg theory more speciic at those places where linguistically motivated underspeciication would lead to ineecient processing. We discuss two concrete hpsg examples showing how oo-line constraint propagation helps improve processing eeciency.

متن کامل

Constraint Propagation

This dissertation presents the design of a propagation-based constraint solver. The design is based on models that span several levels of abstraction, ranging from a mathematical foundation, to a high-level implementation architecture, to concrete data structures and algorithms. This principled design approach results in a wellunderstood, correct, modular, and hence efficient implementation. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Programming Languages and Systems

سال: 2008

ISSN: 0164-0925,1558-4593

DOI: 10.1145/1452044.1452046