Volume 10, Number 1, January 2009
- Alexander Artikis, Marek J. Sergot, Jeremy V. Pitt:
Specifying norm-governed computational societies.

- Lou van den Dries, Yiannis N. Moschovakis:
Arithmetic complexity.

- Neil Yorke-Smith, Carmen Gervet:
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data.

- Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz:
New results on rewrite-based satisfiability procedures.

- Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi, Riccardo Rosati:
Reasoning about actions with sensing under qualitative and probabilistic uncertainty.

- Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A finite equational base for CCS with left merge and communication merge.

- Juha Kontinen:
A logical characterization of the counting hierarchy.

Volume 10, Number 2, February 2009
Volume 10, Number 3, April 2009
- Stavros Tripakis:
Checking timed Büchi automata emptiness on simulation graphs.

- Stéphane Demri, Ranko Lazic:
LTL with the freeze quantifier and register automata.

- Lucas Bordeaux, Marco Cadoli, Toni Mancini:
Generalizing consistency and other constraint properties to quantified constraints.

- Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning.

- Mingsheng Ying, Yuan Feng, Runyao Duan, Zheng-Feng Ji:
An algebra of quantum processes.

- Adel Bouhoula:
Simultaneous checking of completeness and ground confluence for algebraic specifications.

- Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind:
Tableau calculus for preference-based conditional logics: PCL and its extensions.

- Akitoshi Kawamura:
Differential recursion.

Volume 10, Number 4, August 2009
- Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca:
Guest editorial: Special issue on implicit computational complexity.

- Toshiyasu Arai, Naohi Eguchi:
A new function algebra of EXPTIME functions by safe nested recursion.

- Ugo Dal Lago:
Context semantics, linear logic, and computational complexity.

- Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher:
Extending the loop language with higher-order procedural variables.

- Jean-Yves Marion, Romain Péchoux:
Sup-interpretations, a semantic method for static analysis of program resources.

- Neil D. Jones, Lars Kristiansen:
A flow calculus of mwp-bounds for complexity analysis.

- Jean-Yves Moyen:
Resource control graphs.

Last update Tue May 21 19:50:24 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page