Algebraic and Logic Programming
Editat de Giorgio Levi, Mario Rodriguez-Artalejoen Limba Engleză Paperback – 24 aug 1994
Like the predecessor conferences in this series, ALP '94 succeeded in strengthening the cross-fertilization between algebraic techniques and logic programming. Besides abstracts of three invited talks, the volume contains 17 full revised papers selected from 41 submissions; the papers are organized into sections on theorem proving, narrowing, logic programming, term rewriting, and higher-order programming.
Preț: 323.39 lei
Preț vechi: 404.23 lei
-20%
Puncte Express: 485
Preț estimativ în valută:
57.19€ • 65.57$ • 49.42£
57.19€ • 65.57$ • 49.42£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540584315
ISBN-10: 3540584315
Pagini: 324
Ilustrații: X, 314 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540584315
Pagini: 324
Ilustrații: X, 314 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Concurrent constraint programming.- Specifications using multiple-conclusion logic programs.- Viewing a program transformation system at work.- Proving implications by algebraic approximation.- Sufficient completeness and parameterized proofs by induction.- Proving behavioural theorems with standard first-order logic.- How to realize LSE narrowing.- Compositional analysis for equational Horn programs.- Equation solving in projective planes and planar ternary rings.- From eventual to atomic and locally atomic CC programs: A concurrent semantics.- Concurrent logic programming as uniform linear proofs.- Three-valued completion for abductive logic programs.- A sequential reduction strategy.- On modularity of termination and confluence properties of conditional rewrite systems.- Syntactical analysis of total termination.- Logic programs as term rewriting systems.- Higher-order minimal function graphs.- Reasoning about layered, wildcard and product patterns.- Preserving universal termination through unfold/fold.- A logic for variable aliasing in logic programs.