An important class of algorithms for constraint optimization searches for solutions guided by a heuristic evaluation function (bound). When only a few best solutions are required, significant effort can be wasted pre-...
详细信息
We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search first towards a small and structured combinator...
详细信息
CGLIB is a high-level graphics library for B-Prolog, a constraint logic programming system. the library provides primitives for creating and manipulating graphical objects and a set of constraints including non-overla...
ISBN:
(纸本)3540232419
CGLIB is a high-level graphics library for B-Prolog, a constraint logic programming system. the library provides primitives for creating and manipulating graphical objects and a set of constraints including non-overlap, grid, table, and tree constraints that facilitates the specification of the layouts of objects. the library adopts a construct called action rules available in B-Prolog for creating agents and programming interactions among agents or between agents and the user. the library is a fully working system implemented in B-Prolog, Java and C. It can be used in many areas such as drawing editors, interactive user interfaces, document authoring, animation, information visualization, intelligent agents, and games. the high-level abstraction of the library and the use of constraints and action rules in the specification of layouts and behaviors can significantly enhance the productivity of the development of graphics. We demonstrate through several examples the effectiveness of the library as a tool for developing graphics-rich and interactive user interfaces. the system is available from *** and the details of the library can be found in [1].
Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. the generalization lifts, in a uniform way, the concept of ref...
详细信息
this paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby g...
详细信息
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. this can be especially useful in a real-time process control or ...
详细信息
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling, and timetabling. these are hard computational problems given their inherent combinatorial s...
详细信息
this paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keeping track of which propagators are at ...
详细信息
Scheduling is one of the most successful application areas of constraintprogramming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding fi...
详细信息
We have designed and implemented a system for the management of Graduate Teaching Assistants (GTAs) in our department. the system is based on constraint Processing techniques and is operated through web-based interfac...
ISBN:
(纸本)3540232419
We have designed and implemented a system for the management of Graduate Teaching Assistants (GTAs) in our department. the system is based on constraint Processing techniques and is operated through web-based interfaces. the task is to assign GTAs, based on their qualifications, availability, and preferences, to academic tasks over a semester such as grading, supervising labs and recitations, and teaching introductory classes. Typically, every semester, the department has about 70 different academic tasks and can hire between 25 and 40 GTAs. the problem is often tight and sometimes over-constrained. In the past, this task has been performed manually by members of the staff and faculty. Tentative schedules were iteratively refined based on feedback from faculty and the GTAs themselves, in a tedious and error-prone process lingering over 3 weeks. We have built web-based interfaces to streamline the collection of data and specification of constraints.
暂无评论