1948 search results - page 150 / 390 » Formalizing Mirror Theory |
157
click to vote
JSYML
2008
15 years 6 months ago
2008
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
169
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
191
click to vote
ATAL
2005
Springer
16 years 1 days ago
2005
Springer
In this paper we consider how a BDI agent might determine its best course of action. We draw on previous work which has presented a model of persuasion over action and we discuss ...
175
click to vote
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 12 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....
203
click to vote
AIIA
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we are interested in argument based reasoning for access control, for example in the context of agents negotiating access to resources or web services in virtual orga...