Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar9th CSL 1995: Paderborn, Germany
- Hans Kleine Büning:
Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers. Lecture Notes in Computer Science 1092, Springer 1996, ISBN 3-540-61377-3 - Matthias Baaz, Alexander Leitsch, Richard Zach:
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. 1-15 - José Barros, Joseph A. Goguen:
Semantics of Non-terminating Rewrite Systems Using Minimal Coverings. 16-35 - Gilles Barthe, Herman Geuvers:
Congruence Types. 36-51 - Bernhard Beckert, Reiner Hähnle
:
Deduction by Combining Semantic Tableaux and Integer Programming. 52-63 - Bernhard Beckert, Joachim Posegga:
leanEA: A Lean Evolving Algebra Compiler. 64-85 - Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke:
A Proof System for Finite Trees. 86-105 - Jason Brown, Lincoln A. Wallen:
Representing Unification in a Logical Framework. 106-129 - Ricardo Caferra, Nicolas Peltier:
Decision Procedures Using Model Building Techniques. 130-144 - Peter Clote:
A Note on the Relation Between Polynomial Time Functionals and Constable's Class K. 145-160 - Anuj Dawar, Steven Lindell, Scott Weinstein:
First Order Logic, Fixed Point Logic and Linear Order. 161-177 - Anatoli Degtyarev, Andrei Voronkov:
Simultaneous Regid E-Unification Is Undecidable. 178-190 - Giuseppe Del Castillo, Igor Durdanovic, Uwe Glässer:
An Evolving Algebra Abstract Machine. 191-214 - Roberto Di Cosmo, Delia Kesner:
Rewriting with Extensional Polymorphic Lambda-Calculus. 215-232 - Manfred Droste, Dietrich Kuske:
Languages and Logical Definability in Concurrency Monoids. 233-251 - Stéphane Grumbach, Zoé Lacroix, Steven Lindell:
Generalized Implicit Definitions on Finite Structures. 252-265 - Yuri Gurevich, James K. Huggins:
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. 266-290 - Ryu Hasegawa:
A Logical Aspect of Parametric Polymorphism. 291-307 - Alain Heuerding, Stefan Schwendimann:
On the Modal Logic K Plus Theories. 308-319 - Jörg Hudelmaier:
Improved Decision Procedures for the Modal Logics K, T, and S4. 320-334 - Anna Ingólfsdóttir, Andrea Schalk:
A Fully Abstract Denotational Model for Observational Precongruence. 335-361 - Jan Johannsen:
On Sharply Bounded Length Induction. 362-367 - Martin Kummer, Matthias Ott:
Effective Strategies for Enumeration Games. 368-387 - Hans Leiß:
Bounded Fixed-Point Definability and Tabular Recognition of Languages. 388-402 - Till Mossakowski:
Equivalences among Various Logical Frameworks of Partial Algebras. 403-433 - Paritosh K. Pandya:
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability. 434-451 - Albert Rubio:
Theorem Proving modulo Associativity. 452-467 - Laurent Vigneron:
Positive Deduction modulo Regular Theories. 468-485
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2020-06-05 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
