Cantitate/Preț
Produs

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

Editat de Egon Börger, Hans Kleine Büning, Michael M. Richter
en Limba Engleză Paperback – 10 iul 1990
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32720 lei

Preț vechi: 40900 lei
-20% Nou

Puncte Express: 491

Preț estimativ în valută:
6262 6606$ 5219£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540527534
ISBN-10: 3540527532
Pagini: 452
Ilustrații: VIII, 444 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.