As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. This paper addresses the computation of the hitting sets of a group of sets whose elements are convex or non-convex, bounded or unbounded continuous regions. We assume the conflict sets are known and we present a novel procedure, the Continuous Hitting Set algorithm (CHS) for transforming conflict sets of continuous elements into minimal hitting sets.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.