The completeness of gp-resolution for annotated logics

DOI10.1016/0020-0190(92)90053-XzbMath0759.68081OpenAlexW1980008162MaRDI QIDQ1205717

Lawrence J. Henschen, James J. Lu

Publication date: 1 April 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90053-x

zbMATH Keywords

\(gp\)-resolutionrefutation completeness

Mathematics Subject Classification ID

Related Items (2)

\(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) ⋮ \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)

Cites Work

• Paraconsistent disjunctive deductive databases
• A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
• Unnamed Item

This page was built for publication: The completeness of gp-resolution for annotated logics