The Completeness of GP-Resolution for Annotated Logics

[1]  W. W. Bledsoe,et al.  A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness , 1970, JACM.

[2]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[3]  V. S. Subrahmanian.  On the Semantics of Quantitative Logic Programs , 1987, SLP.

[4]  V. S. Subrahmanian.  Paraconsistent disjunctive deductive databases , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

[5]  Lawrence J. Henschen,et al.  Reasoning in Paraconsistent Logics , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.