Sciweavers

1094 search results - page 150 / 219
» On Computing Explanations in Argumentation
Sort
View
ICALP
2004
Springer
14 years 3 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
AOSD
2003
ACM
14 years 3 months ago
Strategic programming meets adaptive programming
Strategic programming is a generic programming idiom for processing compound data such as terms or object structures. At the heart of the approach is the separation of two concern...
Ralf Lämmel, Eelco Visser, Joost Visser
IPTPS
2003
Springer
14 years 3 months ago
Semantic-Free Referencing in Linked Distributed Systems
Every distributed system that employs linking requires a Reference Resolution Service (RRS) to convert link references to locations. We argue that the Web’s use of DNS for this ...
Hari Balakrishnan, Scott Shenker, Michael Walfish
LFCS
1994
Springer
14 years 2 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote
FC
2006
Springer
97views Cryptology» more  FC 2006»
14 years 1 months ago
Privacy-Protecting Coupon System Revisited
Abstract. At FC'05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkabl...
Lan Nguyen