129 search results - page 15 / 26 » Logical Cryptanalysis as a SAT Problem |
AI
2008
Springer
13 years 10 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
ENGL
2007
13 years 9 months ago
2007
—We present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse. Also we show the utility of an automatic demonstrator ...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
CSCLP
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
DEXA
2010
Springer
13 years 10 months ago
2010
Springer
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...