Tableaux and Model Checking for Memory Logics

Areces, Carlos; Figueira, Diego; Gorín, Daniel; Mera, Sergio

doi:10.1007/978-3-642-02716-1_5

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The study we carried out in this paper draws a more detailed picture of the properties of of memory logics. We have investigated these logics in a number of recent papers (Areces, 2007;Areces et al, 2009aAreces et al, , 2009bMera, 2009) in which we present complete axiomatizations, tableaux calculi, complexity analysis for model checking, and preliminary results on the Beth and the interpolation properties for different fragments of this family. But there is still work to be done.…”

Section: Undecidable Memory Logicsmentioning

confidence: 99%

See 1 more Smart Citation

The Expressive Power of Memory Logics

Areces

Figueira

et al. 2011

The Review of Symbolic Logic

Self Cite

View full text Add to dashboard Cite

We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ (↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain.This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic ${\cal K}$ and ℋℒ (↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized.

show abstract

Section: Undecidable Memory Logicsmentioning

confidence: 99%

“…The original idea was introduced in Areces (2007). Areces et al (2009a) investigate tableau algorithms and model checking for memory logics, while Areces et al (2009b) discuss axiomatic completeness results. In this article we extend results originally presented in Areces et al (2008) and provide full proofs.…”

mentioning

confidence: 99%