217 views115 votes15 years 4 months ago AIML 2008»
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
217 views118 votes15 years 4 months ago ATVA 2010»
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
143 views134 votes15 years 4 months ago DLOG 2006»
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
172 views112 votes15 years 4 months ago AAAI 2010»
In this paper, we study the knowledge compilation task for propositional epistemic logic S5. We first extend many of the queries and transformations considered in the classical kn...
133 views123 votes15 years 8 months ago COCO 2004»
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
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, ...
119 views133 votes15 years 6 months ago COCO 2004»
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...
111 views122 votes15 years 10 months ago SEFM 2009»
—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...
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ...
170 views113 votes15 years 3 months ago JANCL 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...