Sciweavers

472 search results - page 40 / 95
» Limiting Negations in Formulas
Sort
View
IANDC
2010
125views more  IANDC 2010»
13 years 8 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat
FORTE
2009
13 years 8 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...
ICCD
2006
IEEE
94views Hardware» more  ICCD 2006»
14 years 7 months ago
Reliability Support for On-Chip Memories Using Networks-on-Chip
— As the geometries of the transistors reach the physical limits of operation, one of the main design challenges of Systems-on-Chips (SoCs) will be to provide dynamic (run-time) ...
Federico Angiolini, David Atienza, Srinivasan Mura...
HRI
2010
ACM
14 years 5 months ago
Gracefully mitigating breakdowns in robotic services
— Robots that operate in the real world will make mistakes. Thus, those who design and build systems will need to understand how best to provide ways for robots to mitigate those...
Min Kyung Lee, Sara Kielser, Jodi Forlizzi, Siddha...
ICLP
2009
Springer
14 years 5 months ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift