CSL B

41 papers

YearTitle / Authors
2002A Fixpoint Theory for Non-monotonic Parallelism.
Yifeng Chen
2002A Fully Abstract Relational Model of Syntactic Control of Interference.
Guy McCusker
2002A Logic for Probabilities in Semantics.
M. Andrew Moshier, Achim Jung
2002A Logic of Probability with Decidable Model-Checking.
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
2002A Proof Theoretical Account of Continuation Passing Style.
Ichiro Ogata
2002A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming.
Joshua S. Hodas, Pablo López, Jeffrey Polakow, Lubomira Stoilova, Ernesto Pimentel
2002Automata, Logic, and XML.
Frank Neven
2002Bijections between Partitions by Two-Directional Rewriting Techniques.
Max I. Kanovich
2002Classical Linear Logic of Implications.
Masahito Hasegawa
2002Compactness and Continuity, Constructively Revisited.
Douglas S. Bridges, Hajime Ishihara, Peter Schuster
2002Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings
Julian C. Bradfield
2002Configuration Theories.
Pietro Cenciarelli
2002Decidability of Bounded Higher-Order Unification.
Manfred Schmidt-Schauß, Klaus U. Schulz
2002Designs, Disputes and Strategies.
Claudia Faggian, Martin Hyland
2002Duality between Call-by-Name Recursion and Call-by-Value Iteration.
Yoshihiko Kakutani
2002Equivalence and Isomorphism for Boolean Constraint Satisfaction.
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002Extraction of Proofs from the Clausal Normal Form Transformation.
Hans de Nivelle
2002Greibach Normal Form in Algebraically Complete Semirings.
Zoltán Ésik, Hans Leiß
2002Higher-Order Positive Set Constraints.
Jean Goubault-Larrecq
2002Hoare Logics for Recursive Procedures and Unbounded Nondeterminism.
Tobias Nipkow
2002Implicit Computational Complexity for Higher Type Functionals.
Daniel Leivant
2002Limit-Computable Mathematics and Its Applications.
Susumu Hayashi, Yohji Akama
2002Local Problems, Planar Local Problems and Linear Time.
Régis Barbanchon, Etienne Grandjean
2002Logical Relations for Monadic Types.
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
2002On Continuous Normalization.
Klaus Aehlig, Felix Joachimski
2002On Generalizations of Semi-terms of Particularly Simple Form.
Matthias Baaz, Georg Moser
2002On the Automatizability of Resolution and Related Propositional Proof Systems.
Albert Atserias, Maria Luisa Bonet
2002On the Variable Hierarchy of the Modal µ-Calculus.
Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
2002Open Proofs and Open Terms: A Basis for Interactive Logic.
Herman Geuvers, Gueorgui I. Jojgov
2002Optimal Complexity Bounds for Positive LTL Games.
Jerzy Marcinkowski, Tomasz Truderung
2002Partial Fixed-Point Logic on Infinite Structures.
Stephan Kreutzer
2002Possible World Semantics for General Storage in Call-By-Value.
Paul Blain Levy
2002Proofnets and Context Semantics for the Additives.
Harry G. Mairson, Xavier Rival
2002Resolution Refutations and Propositional Proofs with Height-Restrictions.
Arnold Beckmann
2002Resource Tableaux.
Didier Galmiche, Daniel Méry, David J. Pym
2002Solving Pushdown Games with a Sigma
Thierry Cachat, Jacques Duparc, Wolfgang Thomas
2002The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL.
Antonín Kucera, Jan Strejcek
2002Trading Probability for Fairness.
Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
2002Travelling on Designs.
Claudia Faggian
2002Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle.
Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin
2002µ-Calculus via Games.
Damian Niwinski