Volume 12, Number 1, October 2010

• 
  Rohit Chadha, Mahesh Viswanathan: A counterexample-guided abstraction-refinement framework for markov decision processes. 1
• 
  Axel Legay, Pierre Wolper: On (Omega-)regular model checking. 2
• 
  Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic datalog over finite structures of bounded treewidth. 3
• 
  Nicola Galesi, Massimo Lauria: Optimality of size-degree tradeoffs for polynomial calculus. 4
• 
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini: Unicast and multicast QoS routing with soft-constraint logic programming. 5
• 
  David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher: An inclusion theorem for defeasible logics. 6
• 
  Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani: Efficient generation of craig interpolants in satisfiability modulo theories. 7
• 
  Carlo A. Furia, Matteo Rossi: A theory of sampling for continuous-time metric temporal logic. 8

Volume 12, Number 2, January 2011

• 
  Yuri Gurevich, Itay Neeman: Logic of infons: The propositional case. 9
• 
  Ranko Lazic: Safety alternating automata on data words. 10
• 
  Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer: Well-founded semantics for description logic programs in the semantic web. 11
• 
  Stefan Szeider: Monadic second order logic on graphs with local cardinality constraints. 12
• 
  Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The tractability of model checking for LTL: The good, the bad, and the ugly fragments. 13
• 
  Paulo Shakarian, Austin Parker, Gerardo I. Simari, V. S. Subrahmanian: Annotated probabilistic temporal logic. 14
• 
  Christian Urban, James Cheney, Stefan Berghofer: Mechanizing the metatheory of LF. 15
• 
  Andreas Blass, Yuri Gurevich: Persistent queries in the behavioral theory of algorithms. 16
• 
  Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio: MWeb: A principled framework for modular web rule bases and its semantics. 17

Volume 12, Number 3, May 2011

• 
  Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson: Modal abstractions of concurrent behavior. 18
• 
  Marcin Jurdzinski, Ranko Lazic: Alternating automata on data trees and XPath satisfiability. 19
• 
  Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. 20
• 
  Jan A. Bergstra, Alban Ponse: Proposition algebra. 21
• 
  José Espírito Santo, Luis Pinto: A calculus of multiary sequent terms. 22

Volume 12, Number 4, July 2011

• 
  Lutz Straßburger, Alessio Guglielmi: A system of interaction and structure IV: The exponentials and decomposition. 23
• 
  Andrei A. Bulatov: Complexity of conservative constraint satisfaction problems. 24
• 
  Paolo Ferraris: Logic programs with propositional connectives and aggregates. 25
• 
  Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß: Unification and matching on compressed terms. 26
• 
  Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data words. 27
• 
  Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Qualitative concurrent parity games. 28
• 
  Md. Aquil Khan, Mohua Banerjee: Logics for information systems and their dynamic extensions. 29

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