825 search results - page 114 / 165 » Modal Logics with Counting |
131
click to vote
ENTCS
2002
15 years 3 months ago
2002
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
125
click to vote
JAPLL
2010
14 years 10 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
125
click to vote
ITA
2007
15 years 3 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
115
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
109
click to vote
CAV
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal µ-calculus capable of defining non-regular properties. Some empiri...