1144 search results - page 166 / 229 » Logic programming for combinatorial problems |
116
Voted
EGC
2005
Springer
15 years 7 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
128
Voted
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 7 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
114
click to vote
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
102
click to vote
AAAI
1994
15 years 3 months ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
163
click to vote
LOGCOM
2010
14 years 9 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...