Sciweavers

3238 search results - page 34 / 648
» On the Computational Interpretation of Negation
Sort
View
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
MHCI
2005
Springer
14 years 3 months ago
SenseMS: a user-centered approach to enrich the messaging experience for teens by non-verbal means
This paper reports the user study and design of a concept to improve mobile messaging for teens. A study of current mobile phone use by teens (16-18) showed that, while they prefe...
Alia K. Amin, B. T. A. Kersten, Olga A. Kulyk, P. ...
CONCUR
1998
Springer
14 years 2 months ago
On Discretization of Delays in Timed Automata and Digital Circuits
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
Eugene Asarin, Oded Maler, Amir Pnueli
SLP
1993
110views more  SLP 1993»
13 years 11 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
RTA
2010
Springer
14 years 1 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann