CSL
2007
Springer
13 years 11 months ago
2007
Springer
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent p...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
CSL
2007
Springer
13 years 11 months ago
2007
Springer
