129 search results - page 26 / 26 » Logical Cryptanalysis as a SAT Problem |
CADE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
KR
2004
Springer
14 years 1 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...