Strong Relevant Logic as the Universal Basis of Various Applied Logics for Knowledge Representation and Reasoning

  • Authors:

  • Jingde Cheng

  • Affiliations:

  • Department of Information and Computer Sciences, Saitama University, Saitama, 338-8570, Japan, cheng@ics.saitama-u.ac.jp

  • Venue:
  • Proceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In many applications in computer science and artificial intelligence, in order to represent, specify, verify, and reason about various objects and relationships among them, we often need a right fundamental logic system to provide us with a criterion of logical validity for reasoning as well as a formal representation and specification language. Although different applications may require different logic systems, the fundamental logics must be able to underlie truth-preserving and relevant reasoning in the sense of conditional, ampliative reasoning, paracomplete reasoning, and paraconsistent reasoning. Based on our experiences, this paper shows that strong relevant logic can be used as the universal basis to construct various applied logics to satisfy the requirements. The paper discusses why any of the classical mathematical logic, its various classical conservative extensions, and its non-classical alternatives is not a suitable candidate for the universal basis to construct various applied logics, shows that strong relevant logic is a more hopeful candidate for the purpose, and presents our experiences on constructions of temporal relevant logics, deontic relevant logics, spatial relevant logics, and spatial-temporal relevant logics.