On uniform proof-theoretical operational semantics for logic programming
Ekaterina Komendantskaya, Vladimir Komendantsky · 2005
We study a general proof-theoretic framework for logic programming, the so-called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance and paranormal sequent calculi). Our result is the construction of prooftheoretic logic programming systems for philosophically significant logics.