Cantitate/Preț
Produs

Extensions of Logic Programming: Third International Workshop, ELP '92, Bologna, Italy, February 26-28, 1992. Proceedings: Lecture Notes in Computer Science, cartea 660

Editat de Evelina Lamma, Paola Mello
en Limba Engleză Paperback – 12 feb 1993
This book contains papers which investigate how to extendlogic programming toward the artificial intelligence andsoftware engineering areas, covering both theoretical andpractical aspects. Some papers investigate topics such asabductive reasoning and negation. Some works discuss how toenhance the expressive power of logic programming byintroducing constraints, sets, and integration withfunctional programming. Other papers deal with thestructuring of knowledge into modules, taxonomies, andobjects, withthe aim of extending logic programming towardsoftware engineering applications. A section is devoted topapers concentrating on proof theory and inspired byGentzen-style sequent or natural deduction systems. Topicssuch as concurrency are considered to enhance the expressivepower of logic languages. Finally, some papers mainlyconcernimplementation techniques for some of these logicprogramming extensions.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32657 lei

Preț vechi: 40821 lei
-20% Nou

Puncte Express: 490

Preț estimativ în valută:
6250 6594$ 5209£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540564546
ISBN-10: 3540564543
Pagini: 436
Ilustrații: X, 426 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

SLWV — A theorem prover for logic programming.- A Correct goal-directed proof procedure for a general logic program with integrity constraints.- Declarative semantics of hypothetical logic programming with negation as failure.- Conditional narrowing with constructive negation.- CLP $$(\mathcal{A}\mathcal{D})$$ as a deductive database language with updates.- Logic programming with functions over order-sorted feature terms.- A direct semantic characterization of RELFUN.- Embedding finite sets in a logic programming language.- A modal framework for structured logic programs.- Metalogic for state oriented programming.- On the semantics of inheritance in logic programming: Compositionality and full abstraction.- The abstract scheme for concurrent programming.- The ?-calculus as a theory in linear logic: Preliminary results.- Natural deduction proof theory for logic programming.- A typed foundation for directional logic programming.- An architecture for Prolog extensions.- Techniques for implementing contexts in Logic Programming.- Implementing a notion of modules in the logic programming language ?Prolog.- Implementational issues in GCLA: A-sufficiency and the definiens operation.