Sciweavers

4217 search results - page 26 / 844
» Computational indistinguishability logic
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
ICTCS
2003
Springer
15 years 3 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
IIE
2008
97views more  IIE 2008»
14 years 9 months ago
Mathematical Logic and Deduction in Computer Science Education
Mathematical logic is a discipline used in sciences and humanities with different point of view. Although in tertiary level computer science education it has a solid place, it does...
Hashim Habiballa, Tibor Kmet
BIRTHDAY
2006
Springer
15 years 1 months ago
Computational Logic in an Object-Oriented World
Logic and object-orientation (OO) are competing ways of looking at the world. Both view the world in terms of individuals. But logic focuses on the relationships between individual...
Bob Kowalski
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao