3119 search results - page 274 / 624 » General Default Logic |
181
click to vote
EGC
2005
Springer
16 years 9 days 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...
183
click to vote
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
16 years 8 days 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....
169
click to vote
ISSTA
2004
ACM
16 years 6 days 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...
198
click to vote
ICSOC
2004
Springer
16 years 5 days ago
2004
Springer
Over the last few years several process-based web service composition languages have emerged, such as BPEL4WS and BPML. These languages define the composition on the basis of a pr...
168
click to vote
SEMWEB
2004
Springer
16 years 4 days ago
2004
Springer
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...