3891 search results - page 365 / 779 » A logic for strategic reasoning |
190
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
172
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
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...
231
click to vote
FROCOS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
174
click to vote
CSL
2007
Springer
16 years 28 days ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
169
click to vote
TARK
2007
Springer
16 years 26 days ago
2007
Springer
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...