Primal Infon Logic with Conjunctions as Sets

  • Carlos Cotrini
  • Yuri Gurevich
  • Ori Lahav
  • Artem Melentyev
Conference paper

DOI: 10.1007/978-3-662-44602-7_19

Volume 8705 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Cotrini C., Gurevich Y., Lahav O., Melentyev A. (2014) Primal Infon Logic with Conjunctions as Sets. In: Diaz J., Lanese I., Sangiorgi D. (eds) Theoretical Computer Science. TCS 2014. Lecture Notes in Computer Science, vol 8705. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Carlos Cotrini
    • 1
  • Yuri Gurevich
    • 2
  • Ori Lahav
    • 3
  • Artem Melentyev
    • 4
  1. 1.Swiss Federal Institute of TechnologySwitzerland
  2. 2.Microsoft ResearchRedmondUSA
  3. 3.Tel Aviv UniversityIsrael
  4. 4.Ural Federal UniversityRussia