Sciweavers

472 search results - page 4 / 95
» Limiting Negations in Formulas
Sort
View
ACTA
2004
97views more  ACTA 2004»
13 years 7 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
IJISEC
2007
66views more  IJISEC 2007»
13 years 7 months ago
Protecting data privacy through hard-to-reverse negative databases
The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set DB of data elements can be represented in terms of its complement set...
Fernando Esponda, Elena S. Ackley, Paul Helman, Ha...
CORR
2011
Springer
137views Education» more  CORR 2011»
13 years 2 months ago
Existential witness extraction in classical realizability and via a negative translation
Abstract. We show how to extract existential witnesses from classical proofs using Krivine’s classical realizability—where classical proofs are interpreted as λ-terms with the...
Alexandre Miquel
MOC
2002
73views more  MOC 2002»
13 years 7 months ago
Evaluation of zeta function of the simplest cubic field at negative odd integers
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
Hyun Kwang Kim, Jung Soo Kim
QUESTA
2008
89views more  QUESTA 2008»
13 years 7 months ago
The asymptotic variance rate of the output process of finite capacity birth-death queues
We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form + vi where is the rate of outputs...
Yoni Nazarathy, Gideon Weiss