{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:30Z","timestamp":1750308210286,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>The combinatorial completion problem arises where one wishes to define a set of rules which collectively address all possible combinations of circumstances, as, for example, in a decision table. After some rules have been defined but, e.g., millions of cases remain to be addressed, how can the specifier best be helped to complete the remaining rules so that they cover every possible scenario? A novel technique is described based on providing interactive feedback to the user during rule definition. This can be used with non-tabular as well as tabular rules. Where previously quality would have depended on essentially sample-based approaches like testing, this technique makes it easy to adopt a rigorously complete approach to considering large numbers of possibilities.<\/jats:p>","DOI":"10.1145\/1050849.1050861","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial completion by rule definition with interactive value colouring"],"prefix":"10.1145","volume":"30","author":[{"given":"Michael","family":"Breen","sequence":"first","affiliation":[{"name":"Independent consultant"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"volume-title":"Technical Report Version 0.2, ATCNY (previously Odyssey Research Associates). Cornell Business & Technology Park, 33 Thornwood Drive, Suite 500.","year":"1993","author":"User Manual SAST","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00323-5"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CMPASS.1995.521890"},{"key":"e_1_2_1_5_1","unstructured":"Statestep website. http:\/\/statestep.com.  Statestep website. http:\/\/statestep.com."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00766-004-0209-1"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1050849.1050861","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1050849.1050861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:02Z","timestamp":1750264262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1050849.1050861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1050849.1050861"],"URL":"https:\/\/doi.org\/10.1145\/1050849.1050861","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}