by Bernd Bachmann
HieraCon - a Knowledge Representation System with Typed Hierarchies and Constraints
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.
This document is available as PDF-File.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.