Results 1  10
of
104,675
Primal Infon Logic: Derivability in Polynomial Time
"... Primal infon logic (PIL), introduced by Gurevich and Neeman in 2009, is a logic for authorization in distributed systems. It is a variant of the (→, ∧)fragment of intuitionistic modal logic. It presents many interesting technical challenges – one of them is to determine the complexity of the deriva ..."
Abstract
 Add to MetaCart
Primal infon logic (PIL), introduced by Gurevich and Neeman in 2009, is a logic for authorization in distributed systems. It is a variant of the (→, ∧)fragment of intuitionistic modal logic. It presents many interesting technical challenges – one of them is to determine the complexity
TRANSITIVE PRIMAL INFON LOGIC
"... Abstract. Primal infon logic was introduced in 2009 in connection with access control. In addition to traditional logic constructs, it contains unary connectives p said indispensable in the intended access control applications. Propositional primal infon logic is decidable in linear time, yet suffic ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Primal infon logic was introduced in 2009 in connection with access control. In addition to traditional logic constructs, it contains unary connectives p said indispensable in the intended access control applications. Propositional primal infon logic is decidable in linear time, yet
Basic primal infon logic
, 2012
"... Primal infon logic (PIL) was introduced in 2009 in the framework of policy and trust management. In the meantime, some generalizations appeared, and there have been some changes in the syntax of the basic PIL. This paper is on the basic PIL, and one of our purposes is to “institutionalize ” the chan ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
” the changes. We prove a smallmodel theorem for the propositional fragment of basic primal infon logic (PPIL), give a simple proof of the PPIL locality theorem, and present a lineartime decision algorithm (announced earlier) for PPIL in a form convenient for generalizations. For the sake of completeness, we
The logic of infons
"... Infons are pieces of information. In our work on the Distributed Knowledge Authorization Language (DKAL), we discovered that the logic of infons is a conservative extension of intuitionistic logic by means of connectives p said and p put where p ranges over principals. We investigate infon logic and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
result is a linear time algorithm for the GMD problem for the primal infon logic given a constant bound on the quotation depth of the hypotheses. In applications quotationdepth is small. Our result gives rise to a linear time algorithm for the GMD problem for SecPAL, a precursor of DKAL that expresses
Logic of Infons: the Propositional Case
"... Infons are statements viewed as containers of information (rather then representations of truth values). The logic of infons turns out to be a conservative extension of logic known as constructive or intuitionistic. Distributed Knowledge Authorization Language uses additional unary connectives “p sa ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
are on primal infon logic. We construct an algorithm for the multiple derivability problem: Which of the given queries follow from the given hypotheses? Given a bound on the quotation depth of the hypotheses, the algorithm runs in linear time. We quickly discuss the significance of this result for access
Primal Infon Logic with Conjunctions as Sets
"... 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 e ..."
Abstract
 Add to MetaCart
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
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Results 1  10
of
104,675