Logic Programming
Editat de Andrei Voronkoven Limba Engleză Paperback – 6 mai 1992
Preț: 390.08 lei
Puncte Express: 585
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540554608
ISBN-10: 3540554602
Pagini: 532
Ilustrații: XI, 521 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540554602
Pagini: 532
Ilustrații: XI, 521 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Real-time memory management for Prolog.- A process semantics of logic programs.- Logical operational semantics of Parlog Part II: Or-Parallelism.- WAM algebras—A mathematical study of implementation Part 2.- Abdugtive systems for non-monotonig reasoning.- Properties of algorithmic operators.- Deep logic program transformation using abstract interpretation.- Objects in a logic programming framework.- Integrity verification in knowledge bases.- On procedural semantics of metalevel negation.- Probabilistic logic programs and their semantics.- Implementation of Prolog as binary definite programs.- Prolog semantics for measuring space consumption.- Or-parallel Prolog with heuristic task distribution.- A WAM compilation scheme.- Safe positive induction in the programming logic TK.- Wam specification for parallel execution on SIMD computer.- On abstracting the procedural behaviour of logic programs.- Treating enhanced entity relationship models in a declarative style.- Processing of ground regular terms in Prolog.- Compiling Flang.- FIDO: Finite domain consistency techniques in logic programming.- A constructive logic approach to database theory.- Abstract syntax and logic programming.- Deduction search with generalized terms.- A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation.- Free deduction: An analysis of “Computations” in classical logic.- Gentzen-type calculi for modal logic S4 with barcan formula.- Logical foundation for logic programming based on first order linear temporal logic.- Logic Programming with Pseudo-Resolution.- Brave: An OR-parallel dialect of Prolog and its application to artificial intelligence.- A declarative debugging environment for DATALOG.- A sequent calculus for a first order lineartemporal logic with explicit time.- A logical-based language for feature specification and transmission control.- Program transformations and WAM-support for the compilation of definite metaprograms.- Some considerations on the logic PFD.- Logic programming with bounded quantifiers.