default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 13
Volume 13, Number 1, January 2012
- Arie Gurfinkel
, Marsha Chechik:
Robust Vacuity for Branching Temporal Logic. 1:1-1:32 - David Baelde:
Least and Greatest Fixed Points in Linear Logic. 2:1-2:44 - Benno van den Berg, Richard Garner:
Topological and Simplicial Models of Identity Types. 3:1-3:44 - Wouter Gelade, Frank Neven:
Succinctness of the Complement and Intersection of Regular Expressions. 4:1-4:19 - Florent R. Madelaine, Barnaby Martin:
The Complexity of Positive First-Order Logic without Equality. 5:1-5:17 - Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo:
On the Expressive Power of Multiple Heads in CHR. 6:1-6:19 - Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler:
Reachability Problems in Piecewise FIFO Systems. 7:1-7:33 - Jeroen Keiren, Michel A. Reniers, Tim A. C. Willemse:
Structural Analysis of Boolean Equation Systems. 8:1-8:35 - Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. 9:1-9:24
Volume 13, Number 2, April 2012
- Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. 10:1-10:31 - Stefano Berardi, Ugo de'Liguoro:
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs. 11:1-11:21 - Kousha Etessami, Mihalis Yannakakis:
Model Checking of Recursive Probabilistic Systems. 12:1-12:40 - Paulo Shakarian, Gerardo I. Simari, V. S. Subrahmanian:
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation. 13:1-13:33 - Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Simplification Rules for Intuitionistic Propositional Tableaux. 14:1-14:23 - Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Complexity of Data Dependence Problems for Program Schemas with Concurrency. 15:1-15:18 - Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. 16:1-16:43 - Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. 17:1-17:22 - Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
An Implicit Characterization of PSPACE. 18:1-18:36
Volume 13, Number 3, August 2012
- Wouter Gelade, Marcel Marquardt, Thomas Schwentick:
The dynamic complexity of formal languages. 19:1-19:36 - Gilles Dowek, Murdoch James Gabbay:
Permissive-nominal logic: First-order logic over nominal terms and sets. 20:1-20:36 - Franz Baader, Silvio Ghilardi, Carsten Lutz:
LTL over description logic axioms. 21:1-21:32 - Sara Miner More, Pavel Naumov:
Calculus of cooperation and game-based reasoning about protocol privacy. 22:1-22:21 - Kazuhisa Makino, Hirotaka Ono:
Deductive inference for the interiors and exteriors of horn theories. 23:1-23:16 - Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch:
Arithmetic complexity via effective names for random sequences. 24:1-24:18 - Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded computation tree logic. 25:1-25:53 - Robert Goldblatt, Marcel Jackson:
Well-structured program equivalence is highly undecidable. 26:1-26:8 - Rajeev Alur, Pavol Cerný, Scott Weinstein:
Algorithmic analysis of array-accessing programs. 27:1-27:29
Volume 13, Number 4, October 2012
- Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden:
Epistemic Strategies and Games on Concurrent Processes. 28:1-28:35 - Udi Boker, Orna Kupferman:
Translating to Co-Büchi Made Tight, Unified, and Useful. 29:1-29:26 - Pavlos Peppas, Costas D. Koutras, Mary-Anne Williams:
Maps in Multiple Belief Change. 30:1-30:23 - Arnaud Durand, Juha Kontinen:
Hierarchies in Dependence Logic. 31:1-31:21 - Ewa Madalinska-Bugaj, Linh Anh Nguyen:
A Generalized QSQR Evaluation Method for Horn Knowledge Bases. 32:1-32:28 - Steven Schockaert, Jeroen Janssen, Dirk Vermeir:
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains. 33:1-33:39 - Diego Figueira:
Decidability of Downward XPath. 34:1-34:40
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-03-17 20:35 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:
