Computer science logic. 4th workshop, CSL '90, Heidelberg, Germany, October 1--5, 1990. Proceedings (Q1202146)

From MaRDI portal





scientific article; zbMATH DE number 108248
Language Label Description Also known as
English
Computer science logic. 4th workshop, CSL '90, Heidelberg, Germany, October 1--5, 1990. Proceedings
scientific article; zbMATH DE number 108248

    Statements

    Computer science logic. 4th workshop, CSL '90, Heidelberg, Germany, October 1--5, 1990. Proceedings (English)
    0 references
    23 January 1993
    0 references
    The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0925.00072]. Indexed articles: \textit{Arnborg, Stefan; Proskurowski, Andrzej; Seese, Detlef}, Monadic second order logic, tree automata and forbidden minors, 1-16 [Zbl 0942.68648] \textit{Blass, Andreas; Gurevich, Yuri}, On the reduction theory for average case complexity, 17-30 [Zbl 0789.68068] \textit{Burgard, Wolfram}, Efficiency considerations on goal-directed forward chaining for logic programs, 80-94 [Zbl 0789.68122] \textit{Cantone, D.; Cutello, V.; Schwartz, J. T.}, Decision problems for Tarski and Presburger arithmetics extended with sets, 95-109 [Zbl 0794.03015] \textit{Đurđanović, Igor}, A fast garbage collection algorithm for WAM-based PROLOG, 110-127 [Zbl 0811.68081] \textit{Fermüller, Christian}, A resolution variant deciding some classes of clause sets, 128-144 [Zbl 0791.68148] \textit{Gabbay, D. M.}, Algorithmic proof with diminishing resources. I, 156-173 [Zbl 0811.68111] \textit{Goerdt, Andreas}, Cutting plane versus Frege proof systems, 174-194 [Zbl 0796.03056] \textit{Grandjean, Etienne; Robson, J. M.}, RAM with compact memory: A realistic and robust model of computation, 195-233 [Zbl 0789.68052] \textit{Habart, Karol}, Randomness and Turing reducibility restraints, 234-247 [Zbl 0790.68051] \textit{Hähnle, Reiner}, Towards an efficient tableau proof procedure for multiple-valued logics, 248-260 [Zbl 0791.68149] \textit{Hertrampf, Ulrich; Wagner, Klaus}, Interactive proof systems: Provers, rounds, and error bounds, 261-273 [Zbl 0789.68058] \textit{Jaspars, Jan}, A generalization of stability and its application to circumscription of positive introspective knowledge, 289-299 [Zbl 0793.03020] \textit{Mundici, Daniele}, The complexity of adaptive error-correcting codes, 300-307 [Zbl 0799.94010] \textit{Pudlák, Pavel}, Ramsey's theorem in bounded arithmetic, 308-317 [Zbl 0795.03081] \textit{Ranaivoson, Solomampionona}, Nontrivial lower bounds for some NP-problems on directed graphs, 318-339 [Zbl 0942.68649] \textit{Rauszer, Cecylia M.}, Expansions and models of autoepistemic theories, 340-353 [Zbl 0789.68134] \textit{Stärk, Robert F.}, On the existence of fixpoints in Moore's autoepistemic logic and the non- monotonic logic of McDermott and Doyle, 354-365 [Zbl 0789.68135] \textit{Szabo, M. E.}, On the tracking of loops in automated deductions, 366-388 [Zbl 0850.68299] \textit{Vollmer, Heribert}, The gap-language-technique revisited, 389-399 [Zbl 0790.68046]
    0 references
    Heidelberg (Germany)
    0 references
    CSL '90
    0 references
    Computer science logic
    0 references
    Logic
    0 references
    Workshop
    0 references
    Proceedings
    0 references

    Identifiers