Find a copy online
Links to this item
(n.149, 1983 - current) available via SpringerLink
springerlink.com Connect to Internet resource
Find a copy in the library
Finding libraries that hold this item...
Details
Genre/Form: | Electronic resources (Books) Conference papers and proceedings Congresses Congrès |
---|---|
Additional Physical Format: | Online version: Workshop on Computer Science Logic (4th : 1990 : Heidelberg, Germany). Computer science logic. Berlin ; New York : Springer-Verlag, ©1991 (OCoLC)908773522 |
Material Type: | Conference publication, Internet resource |
Document Type: | Book, Internet Resource |
All Authors / Contributors: |
E Börger |
ISBN: | 3540544879 9783540544876 0387544879 9780387544878 |
OCLC Number: | 24246876 |
Notes: | A selection of papers presented at the workshop CSL'90 which was held at the Max-Planck-Haus in Heidelberg, Germany from October 1-5, 1990. |
Description: | viii, 399 pages : illustrations ; 25 cm. |
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. |
Series Title: | Lecture notes in computer science, 533. |
Responsibility: | E. Börger [and others], eds. |
More information: |
Abstract:
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).
Read more...
Reviews

