Abstract
AbstractA 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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
