Conferences in DBLP
Stefan Arnborg , Andrzej Proskurowski , Detlef Seese Monadic Second Order Logic, Tree Automata and Forbidden Minors. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:1-16 [Conf ] Andreas Blass , Yuri Gurevich On the Reduction Theory for Average Case Complexity. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:17-30 [Conf ] Egon Börger , Dean Rosenzweig From Prolog Algebras Towards WAM - A Mathematical Study of Implementation. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:31-66 [Conf ] Egon Börger , Peter H. Schmitt A Formal Operational Semantics for Languages of Type Prolog III. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:67-79 [Conf ] Wolfram Burgard Efficiency Considerations on Goal-Directed Chaining for Logic Programs. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:80-94 [Conf ] Domenico Cantone , Vincenzo Cutello , Jacob T. Schwartz Decision Problems for Tarski and Presburger Arithmetics Extended With Sets. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:95-109 [Conf ] Igor Durdanovic A Fast Garbage Collection Algorithm for WAM-Based Prolog. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:110-127 [Conf ] Christian G. Fermüller A Resolution Variant Deciding some Classes of Clause Sets. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:128-144 [Conf ] Andreas Flögel , Marek Karpinski , Hans Kleine Büning Subclasses of Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:145-155 [Conf ] Dov M. Gabbay Algorithmic Proof with Diminishing Resources, Part 1. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:156-173 [Conf ] Andreas Goerdt Cuting Plane Versus Frege Proof Systems. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:174-194 [Conf ] Etienne Grandjean , J. M. Robson RAM with Compact Memory: A Realistic and Robust Model of Computation. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:195-233 [Conf ] Karol Habart Randomness and Turing Reducibility Restraints. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:234-247 [Conf ] Reiner Hähnle Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics. [Citation Graph (1, 0)][DBLP ] CSL, 1990, pp:248-260 [Conf ] Ulrich Hertrampf , Klaus W. Wagner Interactive Proof Systems: Provers, Rounds, and Error Bounds. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:261-273 [Conf ] Zhisheng Huang Logics for Belief Dependence. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:274-288 [Conf ] Jan Jaspars A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:289-299 [Conf ] Daniele Mundici The Complexity of Adaptive Error-Correcting Codes. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:300-307 [Conf ] Pavel Pudlák Ramsey's Theorem in Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:308-317 [Conf ] Solomampionona Ranaivoson Nontrivial Lower Bounds for some NP-Problems on Directed Graphs. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:318-339 [Conf ] Cecylia Rauszer Expansions and Models of Autoepistemic Theories. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:340-353 [Conf ] Robert F. Stärk On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:354-365 [Conf ] M. E. Szabo On the Tracking of Loops in Automated Deductions. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:366-388 [Conf ] Heribert Vollmer The Gap-Language-Technique Revisited. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:389-399 [Conf ]