797 search results - page 124 / 160 » Logics with an existential modality |
103
Voted
ITA
2007
15 years 19 days 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...
96
Voted
ATAL
2010
Springer
15 years 1 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...
CAV
2004
Springer
15 years 6 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...
AML
2007
15 years 26 days ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
137
Voted
AAMAS
2011
Springer
14 years 4 months ago
2011
Springer
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...