Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Abstract. Default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Subsequently, several variants of default logic have been proposed to...
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...