Abstract Logic locking “hides” the functionality of a digital circuit to protect it from counterfeiting, piracy, and malicious design modifications. The original is transformed into “locked” such that reveals its correct only when “unlocked” with secret sequence bits—the key bit-string. However, strong attacks, especially SAT attack uses solver recover bit-string, have been profoundly effective...

In this short note we discuss several perspectives on the notion of Guarded Fragments (GFs) of first-order logic first introduced by Andréka, van Benthem and Németi. We focus on computational aspects, discussing some applications of GFs together with issues like the design of effective decision methods for specific reasoning tasks and the role of GFs in explaining the general good behavior of m...

We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.

Intuitionistic dependence logic was introduced by Abramsky and Väänänen [AV09] as a variant of dependence logic under a general construction of Hodges’ (trump) team semantics. It was proven that there is a translation from intuitionistic dependence logic sentences into second order logic sentences. In this paper, we prove that the other direction is also true, therefore intuitionistic dependenc...