default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 10
Volume 10, Number 1, January 2009
- Alexander Artikis
, Marek J. Sergot, Jeremy V. Pitt:
Specifying norm-governed computational societies. 1:1-1:42 - Lou van den Dries, Yiannis N. Moschovakis:
Arithmetic complexity. 2:1-2:49 - Neil Yorke-Smith, Carmen Gervet:
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data. 3:1-3:41 - Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz:
New results on rewrite-based satisfiability procedures. 4:1-4:51 - Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi, Riccardo Rosati:
Reasoning about actions with sensing under qualitative and probabilistic uncertainty. 5:1-5:41 - Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A finite equational base for CCS with left merge and communication merge. 6:1-6:26 - Juha Kontinen:
A logical characterization of the counting hierarchy. 7:1-7:21
Volume 10, Number 2, February 2009
- Ugo Dal Lago:
The geometry of linear higher-order recursion. 8:1-8:38 - Ruggero Lanotte, Simone Tini:
Probabilistic bisimulation as a congruence. 9:1-9:48 - Isabelle Gnaedig, Hélène Kirchner:
Termination of rewriting under strategies. 10:1-10:52 - Maurizio Gabbrielli, Maria Chiara Meo:
A compositional semantics for CHR. 11:1-11:36 - Stefano Guerrini, Andrea Masini:
Proofs, tests and continuation passing style. 12:1-12:34 - Lutz Schröder, Dirk Pattinson:
PSPACE bounds for rank-1 modal logics. 13:1-13:33 - Paola Bruscoli, Alessio Guglielmi:
On the proof complexity of deep inference. 14:1-14:34
Volume 10, Number 3, April 2009
- Stavros Tripakis:
Checking timed Büchi automata emptiness on simulation graphs. 15:1-15:19 - Stéphane Demri, Ranko Lazic:
LTL with the freeze quantifier and register automata. 16:1-16:30 - Lucas Bordeaux, Marco Cadoli, Toni Mancini:
Generalizing consistency and other constraint properties to quantified constraints. 17:1-17:25 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning. 18:1-18:47 - Mingsheng Ying, Yuan Feng, Runyao Duan, Zheng-Feng Ji:
An algebra of quantum processes. 19:1-19:36 - Adel Bouhoula:
Simultaneous checking of completeness and ground confluence for algebraic specifications. 20:1-20:33 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind:
Tableau calculus for preference-based conditional logics: PCL and its extensions. 21:1-21:50 - Akitoshi Kawamura:
Differential recursion. 22:1-22:22
Volume 10, Number 4, August 2009
- Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca:
Guest editorial: Special issue on implicit computational complexity. 23:1-23:2 - Toshiyasu Arai, Naohi Eguchi:
A new function algebra of EXPTIME functions by safe nested recursion. 24:1-24:19 - Ugo Dal Lago:
Context semantics, linear logic, and computational complexity. 25:1-25:32 - Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher:
Extending the loop language with higher-order procedural variables. 26:1-26:37 - Jean-Yves Marion, Romain Péchoux:
Sup-interpretations, a semantic method for static analysis of program resources. 27:1-27:31 - Neil D. Jones, Lars Kristiansen:
A flow calculus of mwp-bounds for complexity analysis. 28:1-28:41 - Jean-Yves Moyen:
Resource control graphs. 29:1-29:44
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-26 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
