**Author**: Jack Minker

**Publisher:** Morgan Kaufmann Pub

**ISBN:**
**Category : **Computers

**Languages : **en

**Pages : **760

Get Book

**Book Description**
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.

**Author**: Jack Minker

**Publisher:** Morgan Kaufmann Pub

**ISBN:**
**Category : **Computers

**Languages : **en

**Pages : **760

View

**Book Description**
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.

**Author**: Jack Minker

**Publisher:** Morgan Kaufmann

**ISBN:** 1483221121

**Category : **Computers

**Languages : **en

**Pages : **752

View

**Book Description**
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.

**Author**: Jorge Lobo

**Publisher:** MIT Press

**ISBN:** 9780262121651

**Category : **Computers

**Languages : **en

**Pages : **344

View

**Book Description**
This monograph provides an intensive course for graduate students in computer science, as well as others interested in extensions of logic programming, on the theoretical foundations of disjunctive logic programming. Disjunctive logic programming permits the description of indefinite or incomplete information through a disjunction of atoms in the head of a clause. The authors describe model theoretic semantics, proof theoretic semantics, and fix point semantics for disjunctive and normal disjunctive programs (a normal disjunctive program permits negated atoms in the body of a clause) and present theories of negation. They conclude with selected applications to knowledge databases. Jorge Lobo is Assistant Professor in Computer Science at the University of Illinois, Chicago Circle. Jack Minker is Professor in the Department of Computer Science and Institute for Advanced Computer Studies at the University of Maryland. Arcot Rajasekar is Assistant Professor in the Computer Science Department at the University of Kentucky. Contents: Introduction and Background. Definitions and Terminology. Declarative Semantics. Proof Theory. Negation. Weak Negation. Normal Logic Programs. Procedural Semantics: Normal Programs. Disjunctive Databases. Applications.

**Author**: Conjeevaram E. Veni Madhavan

**Publisher:** Springer Science & Business Media

**ISBN:** 9783540520481

**Category : **Computers

**Languages : **en

**Pages : **356

View

**Book Description**
The papers in this volume accepted for the conference on foundations of software technology and theoretical computer science project research results in - Algorithmics: design and analysis of graph, geometric, algebraic and VLSI algorithms; data structures; average analysis; complexity theory; parallel parsing. - Concurrency: algebraic semantics, event structures. - Logic programming: algebraic properties, semantics. - Software technology: program transformations, algebraic methods. These results together with the formal techniques employed to present them reflect current trends pursued by leading research groups around the world. The papers treat their topics in depth by carefully reviewing existing results, developing and demonstrating new techniques and suggesting further directions for research.

**Author**: John W. Lloyd

**Publisher:** Springer Science & Business Media

**ISBN:** 3642831893

**Category : **Computers

**Languages : **en

**Pages : **212

View

**Book Description**
In the two and a half years since the frrst edition of this book was published, the field of logic programming has grown rapidly. Consequently, it seemed advisable to try to expand the subject matter covered in the first edition. The new material in the second edition has a strong database flavour, which reflects my own research interests over the last three years. However, despite the fact that the second edition has about 70% more material than the first edition, many worthwhile topic!! are still missing. I can only plead that the field is now too big to expect one author to cover everything. In the second edition, I discuss a larger class of programs than that discussed in the first edition. Related to this, I have also taken the opportunity to try to improve some of the earlier terminology. Firstly, I introduce "program statements", which are formulas of the form A+-W, where the head A is an atom and the body W is an arbitrary formula. A "program" is a finite set of program statements. There are various restrictions of this class. "Normal" programs are ones where the body of each program statement is a conjunction of literals. (The terminology "general", used in the first edition, is obviously now inappropriate).

**Author**: Joxan Jaffar

**Publisher:** MIT Press

**ISBN:** 9780262600316

**Category : **Computers

**Languages : **en

**Pages : **388

View

**Book Description**
Includes tutorials, lectures, and refereed papers on all aspects of logic programming, The Joint International Conference and Symposium on Logic Programming, sponsored by the Association for Logic Programming, includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet.

**Author**: Hector J. Levesque

**Publisher:** Springer Science & Business Media

**ISBN:** 3642602118

**Category : **Computers

**Languages : **en

**Pages : **405

View

**Book Description**
It is a pleasure and an honor to be able to present this collection of papers to Ray Reiter on the occasion of his 60th birthday. To say that Ray's research has had a deep impact on the field of Artificial Intel ligence is a considerable understatement. Better to say that anyone thinking of do ing work in areas like deductive databases, default reasoning, diagnosis, reasoning about action, and others should realize that they are likely to end up proving corol laries to Ray's theorems. Sometimes studying related work makes us think harder about the way we approach a problem; studying Ray's work is as likely to make us want to drop our way of doing things and take up his. This is because more than a mere visionary, Ray has always been a true leader. He shows us how to proceed not by pointing from his armchair, but by blazing a trail himself, setting up camp, and waiting for the rest of us to arrive. The International Joint Conference on Ar tificial Intelligence clearly recognized this and awarded Ray its highest honor, the Research Excellence award in 1993, before it had even finished acknowledging all the founders of the field. The papers collected here sample from many of the areas where Ray has done pi oneering work. One of his earliest areas of application was databases, and this is re flected in the chapters by Bertossi et at. and the survey chapter by Minker.

**Author**: Paolo Atzeni

**Publisher:** Springer Science & Business Media

**ISBN:** 9783540569749

**Category : **Computers

**Languages : **en

**Pages : **290

View

**Book Description**
This book presents a collection of coordinated scientific papers describing the work conducted and the results achieved within the LOGIDATA+ project, a research action funded by the Italian national research council CNR. Theaim of the LOGIDATA+ project is the definition of advanced database systems which significantly extend the functionalities of the current systems, with specific reference to the application areas for which relational systemsare not considered satisfactory. These new systems will allow the definitionof data with complex structures, the representation of semantic relationships between objects, and the use of powerful query and update languages. They will be based on a combination of techniques originatingfrom relational databases and logic programming, with contributions from object-oriented programming. The goal of the LOGIDATA+ project is the design, definition, and prototype implementation of a database management system with complex structures and a class hierarchy, to be accessed through a rule-based language. This book presents an integrated view of the project at the end of the first phase. The second phase will be mainly concerned with the implementation of prototypes.

**Author**: Helmut Schmidt

**Publisher:** Springer Science & Business Media

**ISBN:** 9783540537540

**Category : **Computers

**Languages : **en

**Pages : **172

View

**Book Description**
The development of database technology has currently reached the stage of deductive database systems which use Horn clauses for defining relations. An important characteristic of these systems is the clear separation of logic and control. However, the programmer cannot affect the control part of a deductive database system. To eliminate this deficiency, this monograph presents a so-called expert deductive database system that allows explicit control of the deduction process. The system consists of an object-level describing the logical aspects of a problem and of a meta-level that contains application-specific control information affecting the object-level deduction process. For example, object-level rules can be disregarded, and some tuples deduced at the object-level can be preferred to others. Besides the architecture of this system, the book also identifies some important possibilities of deduction control which are explained by characteristic examples.

**Author**: Gerard Meurant

**Publisher:** Elsevier

**ISBN:** 0080933920

**Category : **Computers

**Languages : **en

**Pages : **1280

View

**Book Description**
The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.