WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The newly developed behavioral approach to the algebraization of logics extends the applicability of the methods of algebraic logic to a wider range of logical systems, n...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...