LPAR
2001
Springer
14 years 4 months ago
2001
Springer
LPAR
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
LPAR
2001
Springer
14 years 4 months ago
2001
Springer
LPAR
2001
Springer
14 years 4 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
LPAR
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
LPAR
2001
Springer
14 years 4 months ago
2001
Springer
Logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the be...
LOPSTR
2001
Springer
14 years 4 months ago
2001
Springer
LOPSTR
2001
Springer
14 years 4 months ago
2001
Springer
LOPSTR
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
LOPSTR
2001
Springer
14 years 4 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...