Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
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...
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...