{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:29:25Z","timestamp":1773930565465,"version":"3.50.1"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"abstract":"<jats:p>The Boolean approach to computing minimal hitting sets proposed by Lin and Jiang is known to offer very attractive general performance, but also has its issues, specifically with a cardinality-restricted search. In this paper we propose optimizations regarding the refinement rules, also offering a revised decision strategy as well as optimized termination criteria that exploit cardinality bounds. Our experiments including artificial and real-world samples for the bounded and unbounded case show the potential of our work, where we could achieve speed-ups of up to two orders of magnitude.<\/jats:p>","DOI":"10.3233\/978-1-61499-098-7-648","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:27:24Z","timestamp":1740133644000},"source":"Crossref","is-referenced-by-count":1,"title":["Optimizations for the Boolean Approach to Computing Minimal Hitting Sets"],"prefix":"10.3233","author":[{"family":"Pill Ingo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Quaritsch Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2012"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:52:01Z","timestamp":1740135121000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=242&spage=648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-098-7-648","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2012]]}}}