While the purpose of conventional proof calculi is to axiomatise the set of valid sentences of a logic, refutation systems axiomatise the invalid sentences. Such systems are relevant not only for proof-theoretic reasons but also for realising deductive systems for nonmonotonic logics. We introduce Gentzen-type refutation systems for two basic three-valued logics and we discuss an application of one of these calculi for disproving strong equivalence between answer-set programs.
展开▼