Zobrazeno 1 - 10
of 992
pro vyhledávání: '"Ramanujam, R"'
In the symbolic verification of cryptographic protocols, a central problem is deciding whether a protocol admits an execution which leaks a designated secret to the malicious intruder. Rusinowitch & Turuani (2003) show that, when considering finitely
Externí odkaz:
http://arxiv.org/abs/2308.13773
In the symbolic verification of cryptographic protocols, a central problem is deciding whether a protocol admits an execution which leaks a designated secret to the malicious intruder. Rusinowitch and Turuani (2003) show that, when considering finite
Externí odkaz:
http://arxiv.org/abs/2202.04518
Bundled products are often offered as good deals to customers. When we bundle quantifiers and modalities together (as in $\exists x \Box$, $\Diamond \forall x$ etc.) in first-order modal logic (FOML), we get new logical operators whose combinations p
Externí odkaz:
http://arxiv.org/abs/2202.01581
Autor:
Ramanujam, R.
Publikováno v:
EPTCS 335, 2021, pp. 269-280
We offer a very simple model of how collective memory may form. Agents keep signalling within neighbourhoods, and depending on how many support each signal, some signals "win" in that neighbourhood. By agents interacting between different neighbourho
Externí odkaz:
http://arxiv.org/abs/2106.11505
Publikováno v:
In Information and Computation August 2023 293
Publikováno v:
EPTCS 297, 2019, pp. 106-120
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a new one. Thi
Externí odkaz:
http://arxiv.org/abs/1907.09100
Autor:
Padmanabha, Anantha, Ramanujam, R.
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order modal logic
Externí odkaz:
http://arxiv.org/abs/1904.10260
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Padmanabha, Anantha, Ramanujam, R
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we consider a va
Externí odkaz:
http://arxiv.org/abs/1811.09454