Processing Declarative Knowledge
Editat de Harold Boley, Michael M. Richteren Limba Engleză Paperback – 4 dec 1991
Preț: 329.94 lei
Preț vechi: 412.42 lei
-20%
Puncte Express: 495
Preț estimativ în valută:
58.34€ • 67.69$ • 50.48£
58.34€ • 67.69$ • 50.48£
Carte tipărită la comandă
Livrare economică 08-22 mai
Specificații
ISBN-13: 9783540550334
ISBN-10: 354055033X
Pagini: 452
Ilustrații: XII, 440 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354055033X
Pagini: 452
Ilustrații: XII, 440 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Efficient processing of declarative rule-based languages for Databases.- Has dedicated hardware for Prolog a future ?.- Commercial applications of large Prolog knowledge bases.- Compiling conceptual graphs.- Subsumption in knowledge graphs.- A terminological knowledge representation system with complete inference algorithms.- An introduction to dynamic concept systems.- Querying concept-based knowledge bases.- Subsumption computation in an object-oriented data model.- A concise presentation of ITL.- Distributed disjunctions for LIFE.- Reasoning with maximal time intervals.- Nonclassical models for logic programs.- Logical operational semantics of Parlog part I: And-Parallelism.- A tool for building connectionist-like networks based on term unification.- Providing declarative access to a processing system for satellite image data.- Declarative functionality descriptions of interactive reasoning modules.- Rule-aided constraint resolution in Laure.- Flang: A functional-logic language.- Processing functional definitions as declarative knowledge: A reduced bytecode implementation of a functional logic machine.- Reducing scheduling overheads for concurrent logic programs.- A general framework for knowledge compilation.- Data-driven transformation of meta-interpreters: A sketch.- Improving the efficiency of constraint logic programming languages by deriving specialized versions.- Parallelizing Prolog on shared-memory multiprocessors.- Processing abductive reasoning via Contextual Logic Programming.- Efficient implementation of narrowing and rewriting.- Tim: The toulouse inference machine for non-classical logic programming.- Declarative and procedural paradigms-do they really compete?.- The GCLA II programming language.- A brief description of the PROTOS-L system.- PCPL — PROLOG constraint processing library version 2.0.- A mini-description of the ITL system.- Taxon: A concept language with concrete domains.- The ALF system: An efficient implementation of a functional logic language.- Transforming horn clauses for forward reasoning.- Implementation of the functional-logic language flang.- SEPIA 3.0 — An extensible prolog system.- FIDO: Exploring finite domain consistency techniques in logic programming.