Skip to content

Annual Conference on Computer Science Logic

CSL

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

1,493

1987–2026

Papers per year

198780 peak2026

CSL papers

1,493 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1992Model Building by Resolution.Christian G. Fermller, Alexander Leitsch
1992Comparative Transition System Semantics.Tim Fernando
1992The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.Nadia Creignou
1992An "Ehrenfeucht-Frass Game" for Fixpoint Logic and Stratified Fixpoint Logic.Uwe Bosse
1992A Self-Interpreter of Lambda Calculus Having a Normal Form.Alessandro Berarducci, Corrado Bhm
1992Linear Lambda-Calculus and Categorial Models Revisited.P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland
1992Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.Thomas Behrendt, Kevin J. Compton, Erich Grdel
1992Algorithmic Structuring of Cut-free Proofs.Matthias Baaz, Richard Zach
1992The Basic Logic of Proofs.Sergei N. Artmov, Tyko Straen
1992Recursive Inseparability in Linear Logic.Stl Aanderaa, Herman Ruge Jervell
1992A Universal Turing Machine.Stl Aanderaa
1991Proving Termination for Term Rewriting Systems.Andreas Weiermann
1991On Completeness of Program Synthesis Systems.Andrei Voronkov
1991Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic.Jerzy Tyszkiewicz
1991Comparing the Theory of Representations and Constructive Mathematics.A. S. Troelstra
1991Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata.John G. Thistle, Walter Murray Wonham
1991On Completeness for NP via Projection Translations.Iain A. Stewart
1991Quantifier Hierarchies over Word Relations.Sebastian Seibert
1991Minimal from Classical Proofs.Helmut Schwichtenberg
1991A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs.Ulf R. Schmerl
1991A Transformational Methodology for Proving Termination of Logic Programs.M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
1991Ordinal Processes in Comparative Concurrency Semantics.Sophie Pinchinat
1991A Fragment of First Order Logic Adequate for Observation Equivalence.Halit Oguztzn
1991Normal Forms in Infinite-Valued Logic: The Case of One Variable.Daniele Mundici
1991Equational Specification of Abstract Types and Combinators.Karl Meinke
1,3511,375 of 1,493← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.