## Abstract

Hypothetical reasoning, which is one type of abductive reasoning, is an important framework in the development of advanced knowledge-based systems. One problem with hypothetical reasoning is its slow inference speed, which is due to its nonmonotonic inference nature. A fast hypothetical reasoning system with predicate Horn clause expressions has been developed to overcome this problem. However, when the constraints for hypotheses are not strong, the number of hypotheses to be synthetized becomes too large to calculate. The paper presents an efficient hypothetical reasoning method combining best-first search, beam search and branch-and-bound search strategies for computing the optimal solution, which is the most desirable solution in many cases. The effectiveness of this method is shown experimentally using fault-diagnosis problems in logic circuits.

Original language | English |
---|---|

Pages (from-to) | 163-171 |

Number of pages | 9 |

Journal | Knowledge-Based Systems |

Volume | 9 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1996 May |

Externally published | Yes |

## Keywords

- Hypothetical reasoning
- Optimal solution search
- Predicate logic

## ASJC Scopus subject areas

- Artificial Intelligence