General default logic

  • Authors:

  • Yi Zhou;Fangzhen Lin;Yan Zhang

  • Affiliations:

  • Intelligent Systems Lab, School of Computing and Mathematics, University of Western Sydney, Sydney, Australia;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, People's Republic of China;Intelligent Systems Lab, School of Computing and Mathematics, University of Western Sydney, Sydney, Australia

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new nonmonotonic logic called general default logic. On the one hand, it generalizes Reiter's default logic by adding to it rule-like operators used in logic programming. On the other hand, it extends logic programming by allowing arbitrary propositional formulas. We show that with this new logic, one can formalize naturally rule constraints, generalized closed world assumptions, and conditional defaults. We show that under a notion of strong equivalence, sentences of this new logic can be converted to a normal form. We also investigate the computational complexity of various reasoning tasks in the logic, and relate it to some other nonmonotonic formalisms such as Lin and Shoham's logic of GK and Moore's autoepistemic logic.