Computing scenario from knowledge with preferentially ordered hypotheses
Ikuo Tahara · Systems and Computers in Japan · 2004
Abstract A method of computing scenario for knowledge including preferentially ordered hypotheses is proposed. Minimum conflict sets are found for competing hypothesis sets, and acceptable hypothesis sets are then found by applying preference relation to the minimum conflict sets; the disjunction of all elements of the acceptable hypothesis set thus obtained can be added to the fact set without contradiction. A fact set combined with all such disjunctions is considered a scenario, and is used for reasoning. Basically, the acceptability of hypothesis subsets for their minimal conflict sets is to be checked in order to obtain a scenario, which requires combinatorial calculations. A method is proposed to simplify such calculations; namely, acceptability is first checked for the single‐element hypothesis sets, and then set operations are employed to check the acceptability of an arbitrary hypothesis set. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 19–26, 2004; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/scj.10429