Principles and Practice of Constraint Programming - CP97

Visual Solver A modeling language for constraint programming.- Narrowing a 2n-block of sortings in O (n logn).- Solving various weighted matching problems with constraints.- A filtering algorithm for global sequencing constraints.- Semantics and expressive power of a timed concurrent constraint language.- Solving classes of set constraints with tree automata.- The logic of search algorithms: Theory and applications.- Verification of parallel systems using constraint programming.- Random constraint satisfaction: A more accurate picture.- Heavy-tailed distributions in combinatorial search.- Counting, structure identification and maximum consistency for binary constraint satisfaction problems.- Statistical analysis of backtracking on inconsistent CSPs.- Using constraint propagation for complex scheduling problems: Managing size, complex resources and travel.- Understanding and improving the MAC algorithm.- Modelling exceptionally hard constraint satisfaction problems.- Tabu search for maximal constraint satisfaction problems.- Reconfigurable architectures: A new vision for optimization problems.- Distributed partial constraint satisfaction problem.- Localizer A modeling language for local search.- Operational semantics and confluence of constraint propagation rules.- AC-unification of higher-order patterns.- On the complexity of unification and disunification in commutative idempotent semigroups.- Ordering constraints over feature trees.- From restricted path consistency to max-restricted path consistency.- The constrainedness of Arc consistency.- Look-ahead versus look-back for satisfiability problems.- Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs.- Interval methods for non-linear constraints.- Configurable solvers: Tailoring general methods to specific applications.- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems.- Five

Gert Smolka ist seit 1990 Professor für Informatik an der Universität des Saarlandes, wo er in Saarbrücken den Lehrstuhl für Programmiersysteme leitet. Zusammen mit seinen Schülern hat er die Programmiersprachen Oz und Alice entwickelt. Informatik studiert hat Gert Smolka an der Universität Karlsruhe und an der Cornell University, promoviert hat er an der Universität Kaiserslautern. Im Zentrum seiner Forschungsarbeiten stehen Logik und Berechnung, mit Anwendungen bei Programmiersprachen, in der Künstlichen Intelligenz und in der Computerlinguistik.