3572 search results - page 409 / 715 » Nominal Logic Programming |
290
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
194
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
157
click to vote
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
Wireless Sensor Actuator Networks (WSANs) extend wireless sensor networks through actuation capability. Designing robust logic for WSANs however is challenging since nodes can aï¬...
192
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
178
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...