503 search results - page 68 / 101 » Interpolative Boolean Logic |
TCS
2008
15 years 20 days ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
81
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
112
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
166
click to vote
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
114
click to vote
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...