Sciweavers

2432 search results - page 46 / 487
» Cryptographic logical relations
Sort
View
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 2 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
IGPL
2000
103views more  IGPL 2000»
14 years 9 months ago
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
This paper has two goals. First, we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning....
Ofer Arieli, Arnon Avron
CADE
2010
Springer
14 years 11 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 4 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
INLG
2004
Springer
15 years 3 months ago
Overgenerating Referring Expressions Involving Relations and Booleans
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...
Sebastian Varges