نتایج جستجو برای: order logic

تعداد نتایج: 1027572  

Journal: :J. Log. Comput. 1998
Maurizio Castellan Mario Piazza

In this note, we show by a proof-theoretical argument that in full linear logic the set of formulas for which contraction and weakening are admissible (the set of saturated formulas) does not coincide (up to equivalences) with the set of exponentiated formulas. This solves an open problem of Schellinx.

1992
Alessandro Saffiotti

We present BFL, a hybrid logic for representing uncertain knowledge. BFL attaches a quantified notion of belief based on Dempster-Shafer’s theory of belief functions to classical first-order logic. The language of BFL is composed of objects of the form F:[a,b], where F is a first-order sentence, and Q and b are numbers in the [O,l] interval (with c&b). Intuitively, a measures the strength of ou...

Journal: :ACM Transactions on Information and System Security 2008

Journal: :IEICE Transactions on Information and Systems 2020

Journal: :Lecture Notes in Computer Science 2022

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...

1999
Carlos Areces Maarten de Rijke

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...

Journal: :J. Log. Comput. 2016
Sabine Frittella Giuseppe Greco Alexander Kurz Alessandra Palmigiano

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.

Journal: :Studia Logica 2013
Fan Yang

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید