4617 search results - page 829 / 924 » Automation of Diagrammatic Reasoning |
161
click to vote
LPAR
2007
Springer
16 years 29 days ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
180
click to vote
LPAR
2007
Springer
16 years 29 days ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
173
click to vote
LPAR
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
213
click to vote
LPAR
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
156
click to vote
LPNMR
2007
Springer
16 years 29 days ago
2007
Springer
Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the...