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
1989A Streamlined Temporal Completeness Theorem.Ana Pasztor, Ildik Sain
1989On the Representation of Data in Lambda-Calculus.Michel Parigot
1989New Ways for Developing Proof Theories for First-Order Multi Modal Logics.Hans Jrgen Ohlbach
1989Reducibility of Monotone Formulas to µ-Formulas.Daniele Mundici
1989A Predicate Calculus with Control of Derivations.Daniel Mey
1989Omega-Branching Programs of Bounded Width.Christoph Meinel
1989Deciding Horn Classes by Hyperresolution.Alexander Leitsch
1989Polymorphic Recursion and Semi-Unification.Hans Lei
1989Propositional Provability and Models of Weak Arithmetic.Jan Krajcek, Pavel Pudlk
1989Algebraic Operational Semantics and Occam.Yuri Gurevich, Lawrence S. Moss
1989On Logical Descriptions of Some Concepts in Structural Complexity Theory.Erich Grdel
1989Davis-Putnam Resolution versus Unrestricted Resolution.Andreas Goerdt
1989Effectively Given Information Systems and Domains.Manfred Droste, Rdiger Gbel
1989Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution.Hendrik Decker, Lawrence Cavedon
1989On Test Classes for Universal Theories.Bernd I. Dahn
1989The Complexity of Subtheories of the Existential Linear Theory of Reals.Elias Dahlhaus
1989Set-Theoretic Reductions of Hilbert's Tenth Problem.Domenico Cantone, Vincenzo Cutello, Alberto Policriti
1989A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control.Egon Brger
1989On the Verification of Modules.Grigoris Antoniou, Volker Sperschneider
1989Honest Polynomial-Time Degrees of Elementary Recursive Sets.Klaus Ambos-Spies, Dongping Yang
1988On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs.Hubert Wagener
1988A Remark on Minimal Polynomials of Boolean Functions.Bernd Voigt, Ingo Wegener
1988Enforcement of Integrity Constraints in a Semantic Data Model.Norbert Sdkamp, Peter Kandzia
1988Is Average Superlinear Speedup Possible?Ewald Speckenmeyer
1988Integration of Descriptive and Procedural Language Constructs.Wolfgang Schnfeld, Werner Stephan
1,4261,450 of 1,493← PreviousNext →

Comparable venues

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