150 search results - page 8 / 30 » Parameterized Modal Satisfiability |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An unified language for the communicative acts between agents is essential for the design of multi-agents architectures. Whatever the type of interaction (linguistic, multimodal, ...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
SEFM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Contracts and their composition may be used with different goals in a component-based design flow: on the one hand, a component contract describes the guarantees a component is...
LOGCOM
2010
13 years 5 months ago
2010
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ï...
JANCL
2008
13 years 7 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...