Sciweavers

797 search results - page 33 / 160
» Logics with an existential modality
Sort
View
AIML
2008
14 years 12 days ago
PSPACE-decidability of Japaridze's polymodal logic
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
Ilya Shapirovsky
ENTCS
2008
126views more  ENTCS 2008»
13 years 11 months ago
Admissibility of Cut in Coalgebraic Logics
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
Dirk Pattinson, Lutz Schröder
AMAST
2006
Springer
14 years 2 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
JSYML
2007
85views more  JSYML 2007»
13 years 10 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes
IJIS
2011
83views more  IJIS 2011»
13 years 2 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