default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 4
Volume 4, Number 1, January 2003
- Philip Wadler, Peter Thiemann:
The marriage of effects and monads. 1-32 - Hubert Comon, Paliath Narendran, Robert Nieuwenhuis
, Michaël Rusinowitch:
Deciding the confluence of ordered term rewrite systems. 33-55 - James Harland, David J. Pym:
Resource-distribution via Boolean constraints. 56-90 - Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs. 91-119 - Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi:
A complete characterization of complete intersection-type preorders. 120-147
Volume 4, Number 2, April 2003
- Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli:
Computational properties of metaquerying problems. 149-180 - Doron Bustan, Orna Grumberg:
Simulation-based minimazation. 181-206 - Frédéric Mesnard, Salvatore Ruggieri:
On proving left termination of constraint logic programs. 207-259 - Oliver Kutz, Frank Wolter, Holger Sturm, Nobu-Yuki Suzuki, Michael Zakharyaschev:
Logics of metric spaces. 260-294
Volume 4, Number 3, July 2003
- Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno:
LICS 2001 special issue. 295 - Micah Adler, Neil Immerman:
An n! lower bound on formula size. 296-314 - Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu:
Typechecking XML views of relational databases. 315-354 - Dexter Kozen, Jerzy Tiuryn:
Substructural logic and partial correctness. 355-378 - Antonino Salibra:
Topological incompleteness and order incompleteness of the lambda calculu. 379-401 - Jeremy Avigad:
Eliminating definitions and Skolem functions in first-order logic. 402-415
Volume 4, Number 4, October 2003
- Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan, Samuel S. P. Shen, Qiang Yang:
A dynamic approach to characterizing termination of general logic programs. 417-430 - Leonid Libkin:
Variable independence for first-order definable constraints. 431-451 - Jeremy W. Bryans, Howard Bowman, John Derrick:
Model checking stochastic automata. 452-492 - Alberto Momigliano, Frank Pfenning:
Higher-order pattern complement and the strict lambda-calculus. 493-529 - Peter Buneman, Wenfei Fan, Scott Weinstein:
Interaction between path and type constraints. 530-577 - Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms. 578-651
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-10-08 22:27 CEST 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:
