Sciweavers

19 search results - page 2 / 4
» Completeness of the finitary Moss logic
Sort
View
FLAIRS
2006
13 years 5 months ago
Reasoning about Knowledge and Continuity
The aim of this paper is to extend the modal logic of knowledge due to Moss and Parikh by state transformers arising, eg, from actions of agents. The peculiarity of Moss and Parik...
Bernhard Heinemann
ENTCS
2008
102views more  ENTCS 2008»
13 years 3 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
FOSSACS
2008
Springer
13 years 5 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
ENTCS
2008
103views more  ENTCS 2008»
13 years 3 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 3 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...