We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
— While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon’s entropy power inequality (EPI) seems...
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...