CSL '87
Editat de Egon Börger, Hans Kleine Büning, Michael M. Richteren Limba Engleză Paperback – 14 sep 1988
Preț: 325.03 lei
Preț vechi: 406.29 lei
-20%
Puncte Express: 488
Preț estimativ în valută:
57.48€ • 65.91$ • 49.67£
57.48€ • 65.91$ • 49.67£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540502418
ISBN-10: 3540502416
Pagini: 356
Ilustrații: VIII, 348 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540502416
Pagini: 356
Ilustrații: VIII, 348 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Diagonalizing over deterministic polynomial time.- Resolution with feature unification.- Surjectivity for finite sets of combinators by weak reduction.- Proving finite satisfiability of deductive databases.- Is setl a suitable language for parallel programming — a theoretical approach.- Loose diagrams, semigroupoids, categories, groupoids and iteration.- Algebraic operational semantics and modula-2.- Program verification using dynamic logic.- Induction in the elementary theory of types and names.- On the computational complexity of quantified Horn clauses.- The conjunctive complexity of quadratic boolean functions.- On type inference for object-oriented programming languages.- Optimization aspects of logical formulas.- Logic of approximation reasoning.- Deciding the path- and word-fair equivalence problem.- Learning by teams from examples with errors.- A survey of rewrite systems.- Interfacing a logic machine.- Complexity cores and hard-to-prove formulas.- On the average case complexity of backtracking for the exact-satisfiability problem.- On functions computable in nondeterministic polynomial time: Some characterizations.- Developing logic programs: Computing through normalizing.- Model theory of deductive databases.- Algorithms for propositional updates.