Syntactic conditional closures for defeasible reasoning

  • Authors:
  • James P. Delgrande

  • Affiliations:
  • School of Computing Science, Simon Fraser University, Burnaby, BC, Canada

  • Venue:
  • IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

An approach to nonmonotonic inference based on a closure operation on a conditional knowledge base is presented. The central idea is that, given a theory of default conditionals, an extension to the theory le defined that satisfies certain intuitive restrictions Two notions for forming an extension are given, corresponding to the incorporation of irrelevant properties in conditionals and of transitivity among conditionals, in this approach these notions coincide Several equivalent definitions for an extension are developed general nonconstructive definitions, and a general "pseudo-iterative" definition Reasoning with irrelevant properties is correctly handled, as is specificity, reasoning within exceptional circumstances, and inheritance reasoning Tina approach is intented to ultimately serve as the proof-theoretic analogue to an extant semantic development based on preference orderings among possible worlds.