Sound and efficient non-monotonic inference

  • Authors:
  • Hector Geffner;Jimena Llopis;Gisela Mendez

  • Affiliations:
  • Depto. de Computacion, Universidad Simon Bolivar, Caracas, Venezuela;Depto. de Matematicas, Universidad Simon Bolivar, Caracas, Venezuela;Depto. de Matematicas, Univ. Central de Venezuela, Caracas, Venezuela

  • 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

We analyze conditions that allow for sound and efficient non-monotonic inference For that we consider theories comprised of rules and observations and a semantic framework developed elsewhere that allows us to view such theories as dynamic systems systems with a transition function f that maps states to sets of possible successor states and a plausibility function that determines the relative likelihood of those transitions In this framework the transition function f is determined by the rules and the plausibility function is provided independently In this work we aim to identify plausibility functions that have good semantical and computational properties We do so by identifying a vet of tore predictions to be accounted for that can be computed in polynomial time, can be justified in simple terms and are not tied to either Horn theories or closed world assumptions. The resulting functions allow us to handle an interesting class of theories in a justifiable and efficient manner.