|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
1390471 |
| 003 |
ICU |
| 005 |
19970807215900.0 |
| 008 |
921113s1992 enka b 001 0 eng |
| 010 |
|
|
|a 92024864
|
| 020 |
|
|
|a 0201568977
|
| 035 |
|
|
|a (ICU)BID16344926
|
| 035 |
|
|
|a (OCoLC)26260729
|
| 040 |
|
|
|c DLC
|d DLC$dOrLoB
|
| 050 |
0 |
0 |
|a QA76.9.D3
|b D153 1992
|
| 082 |
|
|
|a 006.3/3
|2 20
|
| 100 |
1 |
|
|a Das, Subrata Kumar
|0 http://id.loc.gov/authorities/names/n92069384
|1 http://viaf.org/viaf/86416868
|
| 245 |
1 |
0 |
|a Deductive databases and logic programming /
|c Subrata Kumar Das.
|
| 260 |
|
|
|a Workingham, Eng. ;
|a Reading, Mass. :
|b Addison-Wesley,
|c c1992.
|
| 300 |
|
|
|a xvi, 432 p. :
|b ill. ;
|c 24 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|0 http://id.loc.gov/vocabulary/contentTypes/txt
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|0 http://id.loc.gov/vocabulary/mediaTypes/n
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|0 http://id.loc.gov/vocabulary/carriers/nc
|
| 440 |
|
0 |
|a International series in logic programming
|
| 504 |
|
|
|a Includes bibliographical references (p. [399]-411) and indexes.
|
| 505 |
2 |
0 |
|g Pt. I.
|t Introduction.
|g Ch. 1.
|t History and overview.
|g 1.1.
|t History.
|g 1.2.
|t An informal overview --
|g Pt. II.
|t Background Material.
|g Ch. 2.
|t Mathematical preliminaries.
|g 2.1.
|t Sets.
|g 2.2.
|t Relations.
|g 2.3.
|t Functions.
|g 2.4.
|t Graphs and trees.
|g 2.5.
|t Ordered sets.
|g 2.6.
|t Lattices.
|g 2.7.
|t Ordinals.
|g 2.8.
|t Fixpoints.
|g 2.9.
|t Induction principles.
|g Ch. 3.
|t Mathematical logic.
|g 3.1.
|t Propositional logic.
|g 3.2.
|t Formal axiomatic theory.
|g 3.3.
|t Formal axiomatic theory for propositional logic.
|g 3.4.
|t Soundness and completeness theorem for propositional logic.
|g 3.5.
|t First-order logic.
|g 3.6.
|t Formal axiomatic theory for first-order logic.
|g 3.7.
|t Soundness and completeness theorem for first-order logic.
|g 3.8.
|t Application of soundness and completeness theorem.
|g 3.9.
|t Normal forms of clauses.
|g 3.10.
|t Herbrand's theorem.
|g 3.11.
|t Implementation of Herbrand's theorem.
|g Ch. 4.
|t Resolution theorem proving.
|g 4.1.
|t Resolution principle and unification.
|g 4.2.
|t Resolution theorem.
|g 4.3.
|t Refutation procedure.
|g 4.4.
|t Refinements of the resolution principle.
|g 4.4.1.
|t Input resolution.
|g 4.4.2.
|t Unit resolution.
|g 4.4.3.
|t Linear resolution.
|g 4.4.4.
|t Set of support.
|g 4.4.5.
|t Linear resolution with selection function --
|g Pt. III.
|t Logic Programming.
|g Ch. 5.
|t Logic programming.
|g 5.1.
|t What is logic programming?
|g 5.2.
|t Program clauses and goals.
|g 5.3.
|t Definite, normal and general programs.
|g 5.4.
|t Hierarchical, recursive and stratified programs.
|g 5.5.
|t Semantics of programs.
|g Ch. 6.
|t Definite programs.
|g 6.1.
|t Declarative semantics.
|g 6.2.
|t Fixpoint semantics.
|g 6.3.
|t Equivalence between declarative and fixpoint semantics.
|g 6.4.
|t Procedural semantics.
|g 6.4.1.
|t SLD-resolution.
|g 6.5.
|t Equivalence between declarative and procedural semantics.
|g 6.6.
|t Equivalence among semantics.
|g 6.7.
|t Semantics for negation.
|g 6.7.1.
|t Closed world assumption.
|g 6.7.2.
|t Negation as failure.
|g Ch. 7.
|t Normal programs.
|g 7.1.
|t Generalized fixpoint operator.
|g 7.2.
|t Declarative and fixpoint semantics for stratified programs.
|g 7.3.
|t Stable model semantics.
|g 7.4.
|t Well-founded model.
|g 7.5.
|t Normal program completion.
|g 7.6.
|t SLDNF-resolution.
|g 7.7.
|t Soundness and completeness of SLDNF-resolution.
|g 7.8.
|t Extended normal programs.
|g 7.9.
|t Negation as inconsistency.
|g 7.10.
|t Semantics by three-valued logic.
|g Ch. 8.
|t Disjunctive programs and general programs.
|g 8.1.
|t Disjunctive programs.
|g 8.1.1.
|t Minimal model semantics for disjunctive programs.
|g 8.1.2.
|t Fixpoint semantics for disjunctive programs.
|g 8.1.3.
|t SLI-resolution.
|g 8.1.4.
|t Equivalence among semantics.
|g 8.1.5.
|t The generalized closed world assumption.
|g 8.1.6.
|t The extended generalized closed world assumption.
|g 8.1.7.
|t The weakly generalized closed world assumption.
|g 8.1.8.
|t The disjunctive database rule.
|g 8.2.
|t General programs.
|g 8.2.1.
|t General program completion.
|g 8.2.2.
|t Semantics by possible forms.
|g 8.2.3.
|t Perfect model semantics.
|g 8.3.
|t Circumscription.
|g Ch. 9.
|t Prolog.
|g 9.1.
|t Programs and Goals.
|g 9.2.
|t Syntax.
|g 9.3.
|t Theoretical background.
|g 9.4.
|t Backtracking.
|g 9.5.
|t The cut.
|g 9.6.
|t Special constructs and connectives.
|g 9.7.
|t Negation.
|g 9.8.
|t Equality.
|g 9.9.
|t List.
|g 9.10.
|t Arithmetic.
|g 9.11.
|t Input/output.
|g 9.12.
|t Clause management.
|g 9.13.
|t Set evaluation.
|g 9.14.
|t Meta-programming --
|g Pt. IV.
|t Deductive Databases.
|g Ch. 10.
|t Deductive databases.
|g 10.1.
|t Deductive database model.
|g 10.2.
|t Deductive database systems versus logic programming systems.
|g 10.3.
|t Model theory versus proof theory.
|g 10.4.
|t Model theory for relational databases.
|g 10.5.
|t Proof theory for deductive databases.
|g 10.6.
|t Deductive databases as logic programs.
|g 10.7.
|t Transactions on deductive databases.
|g Ch. 11.
|t Query evaluation.
|g 11.1.
|t What is query evaluation?
|g 11.2.
|t Characteristics of query evaluation methods.
|g 11.2.1.
|t Application domain.
|g 11.2.2.
|t Formalism.
|g 11.2.3.
|t Technique.
|g 11.2.4.
|t Approaches.
|g 11.2.5.
|t Answering techniques.
|g 11.2.6.
|t Modes of evaluation.
|g 11.2.7.
|t Correctness.
|g 11.2.8.
|t Objective.
|g 11.2.9.
|t Representation of clauses.
|g 11.3.
|t Methods of query evaluation.
|g 11.3.1.
|t SLD-AL-resolution.
|g 11.3.2.
|t Naive evaluation.
|g 11.3.3.
|t Seminaive evaluation.
|g 11.3.4.
|t Magic sets.
|g Ch. 12.
|t Integrity constraints.
|g 12.1.
|t What are integrity constraints?
|g 12.2.
|t Classification.
|g 12.3.
|t Representation.
|g 12.4.
|t Satisfiability.
|g 12.5.
|t Verification.
|g Ch. 13.
|t Constraint checking methods.
|g 13.1.
|t The methods.
|g 13.1.1.
|t The method of Lloyd et al.
|g 13.1.2.
|t The method of Decker.
|g 13.1.3.
|t The method of Kowalski et al.
|g 13.1.4.
|t Path finding method.
|g 13.2.
|t Characteristics comparison of the methods.
|g 13.2.1.
|t Constraint satisfiability.
|g 13.2.2.
|t Application domain.
|g 13.2.3.
|t Constraint representation.
|g 13.2.4.
|t Overall strategy.
|g 13.2.5.
|t Implementation performance.
|g 13.2.6.
|t Strategy for induced update computation.
|g 13.2.7.
|t Redundant evaluation of constraints.
|g 13.2.8.
|t Evaluation of unsimplified constraints.
|g 13.2.9.
|t Redundant computation of induced updates.
|g 13.2.10.
|t Characteristics comparison table.
|g Ch. 14.
|t A prototype deductive database system.
|g 14.1.
|t Deductive database system architectures.
|g 14.2.
|t The prototype.
|g Ch. 15.
|t Parallel deductive databases.
|g 15.1.
|t Parallel systems architectures.
|g 15.1.1.
|t Shared nothing architecture.
|g 15.1.2.
|t Shared disk architecture.
|g 15.1.3.
|t Shared everything architecture.
|g 15.2.
|t Query processing in parallel.
|g 15.3.
|t Constraint checking in parallel.
|g Ch. 16.
|t Formalizing aggregate and transitional constraints.
|g 16.1.
|t Aggregate constraints.
|g 16.1.1.
|t Representation.
|g 16.1.2.
|t Satisfiability.
|g 16.1.3.
|t Simplification theorem.
|g 16.1.4.
|t Generalization of other aggregate predicates.
|g 16.2.
|t Transitional constraints.
|g 16.2.1.
|t Implicit update.
|g 16.2.2.
|t Action relations.
|g Pt. V.
|t Conclusion.
|g Ch. 17.
|t Extensions and additional references.
|g 17.1.
|t Typed logic programs and deductive databases.
|g 17.2.
|t Higher order logic programs and deductive databases.
|g 17.3.
|t Specifying deductive databases in meta-logic.
|g 17.4.
|t Additional references.
|t Appendix A: Listing of the prototype.
|
| 650 |
|
0 |
|a Deductive databases
|0 http://id.loc.gov/authorities/subjects/sh87007127
|
| 650 |
|
0 |
|a Logic programming
|0 http://id.loc.gov/authorities/subjects/sh86003454
|
| 650 |
|
7 |
|a Deductive databases.
|2 fast
|0 http://id.worldcat.org/fast/fst00889458
|
| 650 |
|
7 |
|a Logic programming.
|2 fast
|0 http://id.worldcat.org/fast/fst01002056
|
| 850 |
|
|
|a ICU
|
| 901 |
|
|
|a ToCBNA
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a cat
|
| 999 |
f |
f |
|i c0f7c48b-099c-58e0-91c6-14bb382a8b8a
|s 55264419-6f32-5b89-a699-64c95761176b
|
| 928 |
|
|
|t Library of Congress classification
|a QA76.9.D3D1530 1992
|l JCL
|c JCL-Sci
|i 2202420
|
| 927 |
|
|
|t Library of Congress classification
|a QA76.9.D3D1530 1992
|l JCL
|c JCL-Sci
|e CRERAR
|b 36793538
|i 2749548
|
