Sciweavers

1193 search results - page 133 / 239
» A primer of simple theories
Sort
View
ALT
2000
Springer
15 years 11 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
GIS
2010
ACM
15 years 5 months ago
Topological reasoning between complex regions in databases with frequent updates
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...
Arif Khan, Markus Schneider
332
Voted
POPL
2006
ACM
16 years 7 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
307
Voted
POPL
2006
ACM
16 years 7 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
308
Voted
POPL
2005
ACM
16 years 7 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna