Primal infon logic with conjunctions as sets

Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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, (x ∧ y) → z does not entail (y ∧ x) → z, and similarly w → ((x ∧ y) ∧ z) does not entail w → (x ∧ (y ∧ z)). 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.

Original languageEnglish
Title of host publicationTheoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Proceedings
PublisherSpringer Verlag
Pages236-249
Number of pages14
ISBN (Print)9783662446010
DOIs
StatePublished - 2014
Event8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science, TCS 2014 - Rome, Italy
Duration: 1 Sep 20143 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8705 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science, TCS 2014
Country/TerritoryItaly
CityRome
Period1/09/143/09/14

Fingerprint

Dive into the research topics of 'Primal infon logic with conjunctions as sets'. Together they form a unique fingerprint.

Cite this