{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T14:33:02Z","timestamp":1751812382751},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this work we present strategies for (optimal) measurement computation and selection in model- based sequential diagnosis. In particular, assuming a set of leading diagnoses being given, we show how queries (sets of measurements) can be computed and optimized along two dimensions: expected number of queries and cost per query. By means of a suitable decoupling of two optimizations and a clever search space reduction the computations are done without any inference engine calls. For the full search space, we give a method requiring only a polynomial number of inferences and guarantee- ing query properties existing methods do not provide. Evaluation results using real-world problems indicate that the new method computes (virtually) optimal queries instantly independently of the size and complexity of the considered diagnosis problems.<\/jats:p>","DOI":"10.29007\/vd18","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T12:31:34Z","timestamp":1515760294000},"page":"200-180","source":"Crossref","is-referenced-by-count":1,"title":["Inexpensive Cost-Optimized Measurement Proposal for Sequential Model-Based Diagnosis"],"prefix":"10.29007","volume":"4","author":[{"given":"Patrick","family":"Rodler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Schekotihin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"28th International Workshop on Principles of Diagnosis (DX'17)"},"container-title":["Kalpa Publications in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T12:31:35Z","timestamp":1515760295000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/HhPf"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/vd18","relation":{},"ISSN":["2515-1762"],"issn-type":[{"type":"print","value":"2515-1762"}],"subject":[]}}