at.logic.gapt.proofs.resolution
Given a sequent s and a clause a in CNF(-s), PCNF computes an LK proof of a subsequent of s ++ a containing at least a
a sequent not containing strong quantifiers
a clause in the CNF of -s
an LK proof of a subsequent of s ++ a containing at least a
Given a sequent s and a clause a in CNF(-s), PCNF computes an LK proof of a subsequent of s ++ a containing at least a