10997 search results - page 220 / 2200 » On the Structure of Complete Sets |
181
click to vote
JOC
2000
15 years 6 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
146
click to vote
AML
2005
15 years 6 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
207
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
148
click to vote
EJC
2007
15 years 6 months ago
2007
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.