+612 9045 4394
 
CHECKOUT
Computer Science Logic : 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings - Egon Borger

Computer Science Logic

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

By: Egon Borger (Editor), Hans Kleine Buning (Editor), Michael M. Richter (Editor), Wolfgang Schonfeld (Editor)

Paperback

Published: 11th September 1991
Ships: 15 business days
15 business days
$147.02
or 4 easy payments of $36.76 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 11th August 1993
    Ships: 15 business days
    15 business days
    $147.02
  • Paperback View Product Published: 20th July 1994
    Ships: 15 business days
    15 business days
    $125.05
  • Paperback View Product Published: 10th September 1992
    Ships: 15 business days
    15 business days
    $147.02

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), and CSL '87 at the University of Karlsruhe (see LNCS 329). This volume contains 24 papers, chosen by means of a review procedure from the 35 papers presented at the workshop, some of which were invited and some selected from a total of 89 submissions. The papers cover a wide range of topics arising from the applications of logic to computer science.

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.

ISBN: 9783540544876
ISBN-10: 3540544879
Series: Lecture Notes in Computer Science : Book 4th,1990
Audience: General
Format: Paperback
Language: English
Number Of Pages: 402
Published: 11th September 1991
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.16
Weight (kg): 0.58