Sciweavers

2214 search results - page 166 / 443
» Complexity of Reasoning
Sort
View
ACNS
2010
Springer
114views Cryptology» more  ACNS 2010»
15 years 6 months ago
Two New Efficient PIR-Writing Protocols
Assume that a client outsources his database to a remote storage-provider (the server), so that for privacy reasons, the client's database is encrypted by his secret key. Duri...
Helger Lipmaa, Bingsheng Zhang
ACL
1998
15 years 4 months ago
Generating the Structure of Argument
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
Chris Reed, Derek Long
125
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Vladik Kreinovich
110
Voted
FSS
2008
124views more  FSS 2008»
15 years 3 months ago
Exact calculations of extended logical operations on fuzzy truth values
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
Zsolt Gera, József Dombi
122
Voted
DKE
2006
93views more  DKE 2006»
15 years 3 months ago
The ramification problem in temporal databases: Changing beliefs about the past
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Grigoris Antoniou, Dimitris Plexo...