92 search results - page 13 / 19 » Exploiting structure in quantified formulas |
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the alge...
ATAL
2004
Springer
14 years 22 days ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...