Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Demri, Stephane"'
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of SLTL. Fir
Externí odkaz:
http://arxiv.org/abs/2408.08557
Autor:
Demri, Stephane, Quaas, Karin
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete. Using an automata-based approach, we e
Externí odkaz:
http://arxiv.org/abs/2302.05327
Autor:
Bednarczyk, Bartosz, Demri, Stéphane
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (July 28, 2022) lmcs:7409
Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem. We investi
Externí odkaz:
http://arxiv.org/abs/2104.13122
We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static ambient lo
Externí odkaz:
http://arxiv.org/abs/2007.08598
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (August 10, 2021) lmcs:6548
We present the first complete axiomatisation for quantifier-free separation logic. The logic is equipped with the standard concrete heaplet semantics and the proof system has no external feature such as nominals/labels. It is not possible to rely com
Externí odkaz:
http://arxiv.org/abs/2006.05156
We present a general approach to axiomatise separation logics with heaplet semantics with no external features such as nominals/labels. To start with, we design the first (internal) Hilbert-style axiomatisation for the quantifier-free separation logi
Externí odkaz:
http://arxiv.org/abs/1910.05016
The list segment predicate ls used in separation logic for verifying programs with pointers is well-suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separatin
Externí odkaz:
http://arxiv.org/abs/1810.05410
Publikováno v:
In Artificial Intelligence November 2021 300
Publikováno v:
Logical Methods in Computer Science, Volume 12, Issue 3 (August 4, 2016) lmcs:1645
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demo
Externí odkaz:
http://arxiv.org/abs/1604.02887
Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterization of model-checking problems for such operational models is not always
Externí odkaz:
http://arxiv.org/abs/1304.6301