Resource-bounded reasoning and paraconsistency

Martin Allen
Raymond E. Jennings

Abstract

Paraconsistent logic formalizes reasoning from inconsistent information. The preservationist variety of this logic concerns itself with forms of reasoning that preserve properties of information other than those, like overall satisfy and consistency, preserved by classical forms. The study of computation and information processing in the presence of inconsistency has utilized paraconsistent logics, although not generally of the preservationist kind. We argue that situations involving bounded resources for computation can give rise to situations that naturally call for preservationist paraconsistent reasoning. The point is illustrated with reference to memory- and time-limited systems, yielding approximate answers to database queries. 

@InProceedings{Allen01,
  author = 	 {Martin Allen and Raymond E. Jennings},
  title = 	 {Resource-Bounded Reasoning and Paraconsistency},
  booktitle =    {Proceedings of the International Conference on Artificial Intelligence ({ICAI}-01)},
  pages = 	 {796--802},
  year = 	 2001,
  address = 	 {Las Vegas, NV}
}

Download [pdf]