1302 search results - page 136 / 261 » Fair Equivalence Relations |
198
click to vote
ASP
2005
Springer
15 years 11 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
132
click to vote
ICTAC
2005
Springer
15 years 11 months ago
2005
Springer
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic mo...
151
click to vote
PKC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
154
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
174
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...