Computer science logic : 4th workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990 : proceedings
Author(s)
Bibliographic Information
Computer science logic : 4th workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990 : proceedings
（Lecture notes in computer science, 533）
Springer-Verlag, c1991
- : gw
- : us
Available at / 55 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||53391060312
-
Kochi University of Technology.Library
: Berlin007||L49||533000171793,
: gw007||L49||53300017179 -
University of Tsukuba Library, Library on Library and Information Science
: Berlin007.08:L-49:533911006830
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
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.
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.
by "Nielsen BookData"
