Volume 13, Number 1, January 2012

• 
  Arie Gurfinkel, Marsha Chechik: Robust Vacuity for Branching Temporal Logic. 1
• 
  David Baelde: Least and Greatest Fixed Points in Linear Logic. 2
• 
  Benno van den Berg, Richard Garner: Topological and Simplicial Models of Identity Types. 3
• 
  Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. 4
• 
  Florent R. Madelaine, Barnaby Martin: The Complexity of Positive First-Order Logic without Equality. 5
• 
  Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo: On the Expressive Power of Multiple Heads in CHR. 6
• 
  Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler: Reachability Problems in Piecewise FIFO Systems. 7
• 
  Jeroen Keiren, Michel A. Reniers, Tim A. C. Willemse: Structural Analysis of Boolean Equation Systems. 8
• 
  Phuong Nguyen, Stephen A. Cook: The Complexity of Proving the Discrete Jordan Curve Theorem. 9

Volume 13, Number 2, April 2012

• 
  Jordi Levy, Mateu Villaret: Nominal Unification from a Higher-Order Perspective. 10
• 
  Stefano Berardi, Ugo de'Liguoro: Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs. 11
• 
  Kousha Etessami, Mihalis Yannakakis: Model Checking of Recursive Probabilistic Systems. 12
• 
  Paulo Shakarian, Gerardo I. Simari, V. S. Subrahmanian: Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation. 13
• 
  Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: Simplification Rules for Intuitionistic Propositional Tableaux. 14
• 
  Sebastian Danicic, Robert M. Hierons, Michael R. Laurence: Complexity of Data Dependence Problems for Program Schemas with Concurrency. 15
• 
  Jakob Nordström: On the Relative Strength of Pebbling and Resolution. 16
• 
  Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas: The Complexity of Reasoning for Fragments of Autoepistemic Logic. 17
• 
  Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca: An Implicit Characterization of PSPACE. 18

Volume 13, Number 3, August 2012

• 
  Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The dynamic complexity of formal languages. 19
• 
  Gilles Dowek, Murdoch James Gabbay: Permissive-nominal logic: First-order logic over nominal terms and sets. 20
• 
  Franz Baader, Silvio Ghilardi, Carsten Lutz: LTL over description logic axioms. 21
• 
  Sara Miner More, Pavel Naumov: Calculus of cooperation and game-based reasoning about protocol privacy. 22
• 
  Kazuhisa Makino, Hirotaka Ono: Deductive inference for the interiors and exteriors of horn theories. 23
• 
  Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch: Arithmetic complexity via effective names for random sequences. 24
• 
  Alessandro Bianco, Fabio Mogavero, Aniello Murano: Graded computation tree logic. 25
• 
  Robert Goldblatt, Marcel Jackson: Well-structured program equivalence is highly undecidable. 26
• 
  Rajeev Alur, Pavol Cerný, Scott Weinstein: Algorithmic analysis of array-accessing programs. 27

Volume 13, Number 4, October 2012

• 
  Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden: Epistemic Strategies and Games on Concurrent Processes. 28
• 
  Udi Boker, Orna Kupferman: Translating to Co-Büchi Made Tight, Unified, and Useful. 29
• 
  Pavlos Peppas, Costas D. Koutras, Mary-Anne Williams: Maps in Multiple Belief Change. 30
• 
  Arnaud Durand, Juha Kontinen: Hierarchies in Dependence Logic. 31
• 
  Ewa Madalinska-Bugaj, Linh Anh Nguyen: A Generalized QSQR Evaluation Method for Horn Knowledge Bases. 32
• 
  Steven Schockaert, Jeroen Janssen, Dirk Vermeir: Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains. 33
• 
  Diego Figueira: Decidability of Downward XPath. 34

last updated on Sun May 26 05:26:20 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page