Foundations of Deductive Databases and Logic Programming - Couverture rigide

Minker, Jack

Couverture rigide

ISBN 10 : 0934613400 ISBN 13 : 9780934613408

Editeur : Morgan Kaufmann Publishers In, 2000

Synopsis

This landmark volume explores the close relationship between deductive databases and logic programming and the foundational issues they share. A collection of original research, contributed by leading scientists, the book grew out of preliminary work presented at the Workshop on Foundations of Deductive Databases and Logic Programming held in Washington, DC, August 1986. All the papers have been extensively refereed and revised. Part 1 introduces and examines the import of stratified databases, and its relationship to circumscription, and provides a comprehensive survey of the problem of negation in logic programming. Part 2 addresses fundamental theoretical and practical issues in developing large-scale deductive databases and treats problems such as informative answers, semantic optimization, updates and computing answers in non-Horn theories. Part 3 provides results concerning logic programs and parallel complexity. An introductory survey offering background material and an overview of research topics, name and subject indexes, and extensive bibliographies complete the work. Invaluable to graduate students and researchers in deductive databases and logic programming, Foundations of Deductive Databases and Logic Programming will also be of interest to those working in automated theorem proving, artificial intelligence, and expert systems.

A propos du livre

Présentation de l'éditeur

Foundations of Deductive Databases and Logic Programming focuses on the foundational issues concerning deductive databases and logic programming. The selection first elaborates on negation in logic programming and towards a theory of declarative knowledge. Discussions focus on model theory of stratified programs, fixed point theory of nonmonotonic operators, stratified programs, semantics for negation in terms of special classes of models, relation between closed world assumption and the completed database, negation as a failure, and closed world assumption. The book then takes a look at negation as failure using tight derivations for general logic programs, declarative semantics of logic programs with negation, and declarative semantics of deductive databases and logic programs. The publication tackles converting AND-control to OR-control by program transformation, optimizing dialog, equivalences of logic programs, unification, and logic programming and parallel complexity. Topics include parallelism and structured and unstructured data, parallel algorithms and complexity, solving equations, most general unifiers, systems of equations and inequations, equivalences of logic programs, and optimizing recursive programs. The selection is a valuable source of data for researchers interested in pursuing further studies on the foundations of deductive databases and logic programming.

Détails de l'édition

• Éditeur: Morgan Kaufmann Publishers In
• Date d'édition: 2000
• ISBN 10: 0934613400
• ISBN 13: 9780934613408
• Reliure: Relié
• Langue: anglais
• Nombre de pages: 746
• Coordonnées du fabricant: non disponible