Sciweavers

1269 search results - page 111 / 254
» Pi-Calculus in Logical Form
Sort
View
96
Voted
AI
2002
Springer
15 years 17 days ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
DIMACS
1996
15 years 2 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
TCC
2005
Springer
118views Cryptology» more  TCC 2005»
15 years 6 months ago
On the Relationships Between Notions of Simulation-Based Security
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
Anupam Datta, Ralf Küsters, John C. Mitchell,...
94
Voted
DEBS
2003
ACM
15 years 6 months ago
Looking into the past: enhancing mobile publish/subscribe middleware
Publish/subscribe (pub/sub) middleware facilitates loosely coupled cooperation and fits well the needs of spontaneous, ad-hoc interaction. However, newly started mobile applicati...
Mariano Cilia, Ludger Fiege, C. Haul, Andreas Zeid...
88
Voted
EACL
1989
ACL Anthology
15 years 1 months ago
Parsing And Derivational Equivalence
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
Mark Hepple, Glyn Morrill