1353 search results - page 41 / 271 » Streamlined Constraint Reasoning |
CADE
2010
Springer
13 years 9 months ago
2010
Springer
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
COR
2008
13 years 7 months ago
2008
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
IJSSE
2011
13 years 2 months ago
2011
The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. Our work presented in this paper f...