Sciweavers

769 search results - page 78 / 154
» Where Is the Proof
Sort
View
PPDP
2010
Springer
13 years 7 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
SCP
2010
88views more  SCP 2010»
13 years 7 months ago
Incompleteness of relational simulations in the blocking paradigm
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard meth...
Eerke A. Boiten, John Derrick
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 7 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
PPDP
2010
Springer
13 years 6 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
13 years 6 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud