default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 11
Volume 11, Number 1, October 2009
- Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn:
Finitary winning in omega-regular games. 1:1-1:27 - Peter Schneider-Kamp
, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated termination proofs for logic programs by term rewriting. 2:1-2:52 - Valentin Goranko, Dmitry Shkatov:
Tableau-based decision procedures for logics of strategic ability in multiagent systems. 3:1-3:51 - Michael Benedikt, Luc Segoufin:
Regular tree languages definable in FO and in FOmod. 4:1-4:32 - Ferruccio Guidi:
The formal system lambdadelta. 5:1-5:37 - Brigitte Pientka:
Higher-order term indexing using substitution trees. 6:1-6:40 - Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A general framework for sound and complete Floyd-Hoare logics. 7:1-7:31
Volume 11, Number 2, January 2010
- James Bailey, Guozhu Dong, Anthony Widjaja To:
Logical queries over views: Decidability and expressiveness. 8:1-8:35 - Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
Deciding security properties for cryptographic protocols. application to key cycles. 9:1-9:42 - Octavian Udrea, Diego Reforgiato Recupero, V. S. Subrahmanian:
Annotated RDF. 10:1-10:41 - Robin Adams, Zhaohui Luo:
Weyl's predicative classical mathematics as a logic-enriched type theory. 11:1-11:29 - Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos:
Undecidability and intractability results concerning datalog programs and their persistency numbers. 12:1-12:29 - Alwen Tiu, Dale Miller:
Proof search specifications of bisimulation and modal logics for the pi-calculus. 13:1-13:35 - Thomas Eiter, Mantas Simkus:
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols. 14:1-14:50
Volume 11, Number 3, May 2010
- Manuel Bodirsky, Jan Kára:
A fast algorithm and datalog inexpressibility for temporal reasoning. 15:1-15:21 - Kedar S. Namjoshi, Richard J. Trefler:
On the completeness of compositional reasoning methods. 16:1-16:22 - Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding strategy properties of contract-signing protocols. 17:1-17:42 - Nachum Dershowitz, Iddo Tzameret:
Complexity of propositional proofs under a promise. 18:1-18:30 - Eli Ben-Sasson, Prahladh Harsha:
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. 19:1-19:17 - Marko Samer, Helmut Veith:
On the distributivity of LTL specifications. 20:1-20:26
Volume 11, Number 4, July 2010
- Michael Kaminski, Simone Martini:
CSL 2008 special issue. 21:1 - Olaf Beyersdorff, Sebastian Müller:
A tight Karp-Lipton collapse result in bounded arithmetic. 22:1-22:23 - Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Quantitative languages. 23:1-23:38 - Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. 24:1-24:32 - Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta:
On isomorphisms of intersection types. 25:1-25:24 - Martin Hofmann, Ulrich Schöpp:
Pure pointer programs with iteration. 26:1-26:23 - Matthias Horbach, Christoph Weidenbach:
Superposition for fixed domains. 27:1-27:35 - Alexis Saurin:
Typing streams in the Λµ-calculus. 28:1-28:34 - Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
Erratum for "What causes a system to satisfy a specification?". 29:1-29:2
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-02-28 21: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:
