129 search results - page 5 / 26 » Logical Cryptanalysis as a SAT Problem |
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
DATE
1999
IEEE
14 years 26 days ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...