Primal Infon Logic with Conjunctions as Sets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Primal Infon Logic with Conjunctions as Sets


Primal infon logic was proposed by Gurevich and Neeman as an efficient yet expressive logic for policy and trust management. It is a propositional multimodal subintuitionistic logic decidable in linear time. However in that logic the principle of the replacement of equivalents fails. For example, $\left(x \land y\right) \to z$ does not entail $\left(y \land x\right) \to z$, and similarly $w \to \left(\left(x \land y\right)\land z\right)$ does not entail $w \to \left(x \land \left(y \land z\right)\right)$. Imposing the full principle of the replacement of equivalents leads to an NP-hard logic according to a recent result of Beklemishev and Prokhorov. In this paper we suggest a way to regain the part of this principle restricted to conjunction: We introduce a version of propositional primal logic that treats conjunctions as sets, and show that the derivation problem for this logic can be decided in linear expected time and quadratic worst-case time.
Fichier principal
Vignette du fichier
978-3-662-44602-7_19_Chapter.pdf (387.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01402046 , version 1 (24-11-2016)





Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev. Primal Infon Logic with Conjunctions as Sets. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.236-249, ⟨10.1007/978-3-662-44602-7_19⟩. ⟨hal-01402046⟩
62 View
97 Download



Gmail Facebook Twitter LinkedIn More