default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th CSL 1990: Heidelberg, Germany
- Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld:
Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings. Lecture Notes in Computer Science 533, Springer 1991, ISBN 3-540-54487-9 - Stefan Arnborg, Andrzej Proskurowski, Detlef Seese:
Monadic Second Order Logic, Tree Automata and Forbidden Minors. 1-16 - Andreas Blass, Yuri Gurevich:
On the Reduction Theory for Average Case Complexity. 17-30 - Egon Börger, Dean Rosenzweig:
From Prolog Algebras Towards WAM - A Mathematical Study of Implementation. 31-66 - Egon Börger, Peter H. Schmitt:
A Formal Operational Semantics for Languages of Type Prolog III. 67-79 - Wolfram Burgard:
Efficiency Considerations on Goal-Directed Chaining for Logic Programs. 80-94 - Domenico Cantone, Vincenzo Cutello
, Jacob T. Schwartz:
Decision Problems for Tarski and Presburger Arithmetics Extended With Sets. 95-109 - Igor Durdanovic:
A Fast Garbage Collection Algorithm for WAM-Based Prolog. 110-127 - Christian G. Fermüller:
A Resolution Variant Deciding some Classes of Clause Sets. 128-144 - Andreas Flögel, Marek Karpinski, Hans Kleine Büning:
Subclasses of Quantified Boolean Formulas. 145-155 - Dov M. Gabbay:
Algorithmic Proof with Diminishing Resources, Part 1. 156-173 - Andreas Goerdt:
Cuting Plane Versus Frege Proof Systems. 174-194 - Etienne Grandjean, J. M. Robson:
RAM with Compact Memory: A Realistic and Robust Model of Computation. 195-233 - Karol Habart:
Randomness and Turing Reducibility Restraints. 234-247 - Reiner Hähnle:
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics. 248-260 - Ulrich Hertrampf, Klaus W. Wagner:
Interactive Proof Systems: Provers, Rounds, and Error Bounds. 261-273 - Zhisheng Huang:
Logics for Belief Dependence. 274-288 - Jan Jaspars:
A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge. 289-299 - Daniele Mundici:
The Complexity of Adaptive Error-Correcting Codes. 300-307 - Pavel Pudlák:
Ramsey's Theorem in Bounded Arithmetic. 308-317 - Solomampionona Ranaivoson:
Nontrivial Lower Bounds for some NP-Problems on Directed Graphs. 318-339 - Cecylia Rauszer:
Expansions and Models of Autoepistemic Theories. 340-353 - Robert F. Stärk:
On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. 354-365 - Manfred E. Szabo:
On the Tracking of Loops in Automated Deductions. 366-388 - Heribert Vollmer:
The Gap-Language-Technique Revisited. 389-399
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 2025-12-05 22:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
