Sciweavers

Share
CSFW
2012
IEEE
7 years 6 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
CALCO
2011
Springer
235views Mathematics» more  CALCO 2011»
8 years 3 months ago
On the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
Fredrik Dahlqvist, Dirk Pattinson
IJIS
2011
83views more  IJIS 2011»
8 years 7 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide
TLCA
2007
Springer
9 years 10 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
books