2035 search results - page 92 / 407 » On the complexity of stratified logics |
153
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
146
click to vote
PATMOS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The logical effort method has appeared very convenient for fast estimation and optimization of single paths. However it necessitates a calibration of all the gates of the...
166
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
157
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
161
click to vote
AAAI
2006
15 years 7 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...