Skip to main content Skip to main navigation


HieraCon - a Knowledge Representation System with Typed Hierarchies and Constraints

Bernd Bachmann
DFKI, DFKI Documents (D), Vol. 91-12, 1991.


Universal constraint processing algorithms over finite domains lacks the ability to exploit possible internal structures of these domains. This report reveals how typed hierarchies can be used not only to support specialized local propagation algorithms but also to provide heuristics for constraint relaxation. In order to prove the feasibility of the approach the configuration task for computer systems is modeled as an enhanced constraint satisfaction problem (CSP) where specific requirements of the configuration task are mapped into the layout of the constraint network and into a constraint typology with various kinds of constraints, which are definable over the typed hierarchy.