Sciweavers

344 search results - page 44 / 69
» Some Theorems We Should Prove
Sort
View
EXACT
2007
13 years 11 months ago
PML 2: A Modular Explanation Interlingua
In the past five years, we have designed and evolved an interlingua for sharing explanations generated by various automated systems such as hybrid web-based question answering sys...
Deborah L. McGuinness, Li Ding, Paulo Pinheiro da ...
ICWS
2003
IEEE
13 years 10 months ago
Application of Linear Logic to Web Service Composition
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
Jinghai Rao, Peep Küngas, Mihhail Matskin
GC
2007
Springer
13 years 8 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
IACR
2011
105views more  IACR 2011»
12 years 8 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 4 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...