Sciweavers

DEON
2008
Springer
13 years 11 months ago
Introducing Grades in Deontic Logics
In this paper we define a framework to introduce gradedness in Deontic logics through the use of fuzzy modalities. By way of example, we instantiate the framework to Standard Deont...
Pilar Dellunde, Lluis Godo
DEON
2008
Springer
13 years 11 months ago
Trust and Norms in the Context of Computer Security: A Logical Formalization
Abstract. In this paper we present a logical model of trust in which trust is conceived as an expectation of the truster about some properties of the trustee. A general typology of...
Emiliano Lorini, Robert Demolombe
DEON
2008
Springer
13 years 11 months ago
Variations in Access Control Logic
Abstract. In this paper we investigate the design space of access control logics. Specifically, we consider several possible axioms for the common operator says. Some of the axioms...
Martín Abadi
GIS
2007
ACM
13 years 11 months ago
Near-real time motion analysis for APLIS 2007: a systems modeling perspective
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...
CSL
2008
Springer
13 years 11 months ago
On the Relations between the Syntactic Theories of lambda-mu-Calculi
Abstract. Since Parigot's seminal article on an algorithmic interpretation of classical natural deduction [13],
Alexis Saurin
CSL
2008
Springer
13 years 11 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
CSL
2008
Springer
13 years 11 months ago
The Ackermann Award 2008
Johann A. Makowsky, Damian Niwinski
CSL
2008
Springer
13 years 11 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
CSL
2008
Springer
13 years 11 months ago
Quantitative Game Semantics for Linear Logic
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
Ugo Dal Lago, Olivier Laurent
CSL
2008
Springer
13 years 11 months ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel