We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
The development and use of ontologies may require users with no training in formal logic to handle complex concept descriptions. To aid such users, we propose a new visualization f...
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
d Abstract) Sanjeev Arora∗ L´aszl´o Lov´asz† Ilan Newman‡ Yuval Rabani§ Yuri Rabinovich¶ Santosh Vempala Motivated by applications in combinatorial optimization, we ini...