A Complete Axiomatization of the Three valued Completion of Logic Programs

DOI10.1093/logcom/1.6.811zbMath0738.68017OpenAlexW2116554503MaRDI QIDQ3988059

Robert F. Stärk

Publication date: 28 June 1992

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/115273/1/1-6-811.pdf

zbMATH Keywords

sequent calculusthree-valued logicnegation as failureSLDNF-resolution

Mathematics Subject Classification ID

Logic programming (68N17) Many-valued logic (03B50)

Related Items (6)

The role of standardising apart in logic programming ⋮ A simple sequent calculus for partial functions ⋮ First-order theories for pure Prolog programs with negation ⋮ Encoding transition systems in sequent calculus ⋮ What is a Paraconsistent Logic? ⋮ Proof-theoretic notions for software maintenance

This page was built for publication: A Complete Axiomatization of the Three valued Completion of Logic Programs