Volume 11, Number 1, October 2009
- Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated termination proofs for logic programs by term rewriting.
- Valentin Goranko, Dmitry Shkatov: Tableau-based decision procedures for logics of strategic ability in multiagent systems.
- Ferruccio Guidi: The formal system lambdadelta.
- Brigitte Pientka: Higher-order term indexing using substitution trees.
- Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva: A general framework for sound and complete Floyd-Hoare logics.
Volume 11, Number 2, January 2010
- James Bailey, Guozhu Dong, Anthony Widjaja To: Logical queries over views: Decidability and expressiveness.
- Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu: Deciding security properties for cryptographic protocols. application to key cycles.
- Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos: Undecidability and intractability results concerning datalog programs and their persistency numbers.
- Alwen Tiu, Dale Miller: Proof search specifications of bisimulation and modal logics for the pi-calculus.
- Thomas Eiter, Mantas Simkus: FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols.
Volume 11, Number 3, May 2010
- Detlef Kähler, Ralf Küsters, Thomas Wilke: Deciding strategy properties of contract-signing protocols.
Volume 11, Number 4, July 2010
- Nadia Creignou, Henning Schnoor, Ilka Schnoor: Nonuniform Boolean constraint satisfaction problems with cardinality constraint.
- Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta: On isomorphisms of intersection types.
- Alexis Saurin: Typing streams in the Lambdaµ-calculus.
- Hana Chockler, Joseph Y. Halpern, Orna Kupferman: Erratum for "What causes a system to satisfy a specification?".
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team