A Uniform Proof-theoretic Foundation for Abstract Paraconsistent Logic Programming

  • Norihiro Kamide
  • Published 2007 in Journal of Functional and Logic Programming


It is known that paraconsistent logic programming, which is usually based upon a paraconsistent logic, is important in dealing with inconsistency-tolerant and non-monotonic reasoning appropriately. Firstly in this paper, a cut-free single succedent sequent system SN4 and a cut-free multiple succedent sequent system MN4 are introduced for Nelson’s… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics