1088 search results - page 4 / 218 » Independence of Negative Constraints |
ICLP
2001
Springer
13 years 11 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
FSS
2007
13 years 7 months ago
2007
The characterization of S-implications generated from strong negations presented firstly by Trillas and Valverde in 1985 is wellknown in the literature. In this paper we show tha...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...