Cover Image
Read Now

Computer Science Logic 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings

The workshop Computer Science Logic '90 was held at the Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL '89 at the University of Kaiserslautern (see LNCS 440), CSL '88 at the University of Duisberg (see LNCS 385), an...

Full description

Bibliographic Details
Other Authors: Börger, Egon (Editor), Kleine Büning, Hans (Editor), Richter, Michael M. (Editor), Schönfeld, Wolfgang (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1991, 1991
Edition:1st ed. 1991
Series:Lecture Notes in Computer Science
Subjects:
Computer Science Logic And Foundations Of Programming
Computer Science
Mathematical Logic
Algorithms
Formal Languages And Automata Theory
Machine Theory
Applications Of Mathematics
Theory Of Computation
Mathematical Logic And Foundations
Mathematics
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Monadic second order logic, tree automata and forbidden minors
  • On the reduction theory for average case complexity
  • From prolog algebras towards WAM-A mathematical study of implementation
  • A formal operational semantics for languages of type Prolog III
  • Efficiency considerations on goal-directed forward chaining for logic programs
  • Decision problems for tarski and presburger arithmetics extended with sets
  • A fast garbage collection algorithm for WAM — based PROLOG
  • A resolution variant deciding some classes of clause sets
  • Subclasses of quantified boolean formulas
  • Algorithmic proof with diminishing resources part 1
  • Cutting plane versus frege proof systems
  • RAM with compact memory: a realistic and robust model of computation
  • Randomness and turing reducibility restraints
  • Towards an efficient tableau proof procedure for multiple-valued logics
  • Interactive proof systems: Provers, rounds, and error bounds
  • Logics for belief dependence
  • A generalization of stability and its application to circumscription of positive introspective knowledge
  • The complexity of adaptive error-correcting codes
  • Ramsey's theorem in bounded arithmetic
  • Nontrivial lower bounds for some NP-problems on directed graphs
  • Expansions and models of autoepistemic theories
  • On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle
  • On the tracking of loops in automated deductions
  • The gap-language-technique revisited

Similar Items