CSL '89: 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings: 3rd, 1989 (Lecture Notes in Computer Science)

ISBN 10: 3540527532 / ISBN 13: 9783540527534

Editore: Springer, Berlin, 1990

Riguardo questo articolo

437 Seiten Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand Sprache: Englisch Gewicht in Gramm: 550.

Codice articolo 182916

Dati bibliografici

• Titolo: CSL '89: 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings: 3rd, 1989 (Lecture Notes in Computer Science)
• Editore: Springer, Berlin
• Data di pubblicazione: 1990
• Lingua: Inglese
• ISBN 10: 3540527532
• ISBN 13: 9783540527534
• Rilegatura: Taschenbuch
• Condizione: Gut
• Peso: 550 grammi
• Cataloghi dei venditori:
  • Alle Bücher

Descrizione articolo

Riassunto

This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science, e.g. in complexity, data base theory, logic programming, artificial intelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field.

Contenuti

Honest polynomial-time degrees of elementary recursive sets.- On the verification of modules.- A logical operational semantics of full Prolog.- Set-theoretic reductions of Hilbert's tenth problem.- The complexity of subtheories of the existential linear theory of reals.- On test classes for universal theories.- Generalizing allowedness while retaining completeness of SLDNF-resolution.- Effectively given information systems and domains.- Davis-Putnam resolution versus unrestricted resolution.- On logical descriptions of some concepts in structural complexity theory.- Algebraic operational semantics and Occam.- Propositional provability and models of weak arithmetic.- Polymorphic recursion and semi-unification.- Deciding Horn classes by hyperresolution.- ?-branching programs of bounded width.- A predicate calculus with control of derivations.- Reducibility of monotone formulas to ?-formulas.- New ways for developing proof theories for first-order multi modal logics.- On the representation of data in lambda-calculus.- A streamlined temporal completeness theorem.- A concurrent branching time temporal logic.- Semantic for abstract fairness using metric spaces.- On the average time complexity of set partitioning.- A direct proof for the completeness of SLD-resolution.- A quantifier-free completion of logic programs.- Stratification of definite clause programs and of general logic programs.- The semantics of disjunctive deductive databases.- Sequential representation of primitive recursive functions, and complexity classes.