Abduction without Minimality

  • Authors:
  • Abhaya C. Nayak;Norman Y. Foo

  • Affiliations:
  • -;-

  • Venue:
  • AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In most accounts of common-sense reasoning, only the most preferred among models supplied by the evidence are retaiined (and the rest eliminated) in order to enhance the inferential prowess. One problem with this strategy is that the agent's working set of models shrinks quickly in the process. We argue that instead of rejecting all the nonbest models, the reasoner should reject only the worst models and then examine the consequences of adopting this principle in the context of abductive reasoning. Apart from providing the releveint representation results, we indicate why an iterated account of abduction is feasible in this framework.