NAME INDEX

Ackennann, w. 142, 156 Aho, A. V., 26, 30, 31, 36, 56,57

69, 101, 102, 104, 109, 112r 113, 334, 335, 339

Annstrong, W. W., 6, 26, 30, 31, 38, 69, 73, 99, 103, 113

Arora, A., 6, 18, 106, 113 394 413

Artaud, A., 368, 371, Aschbrenner, M., Astrahan, M. M.,

Atkinson, R.,

21, 237, 239, 257, 258

183

Barnes, J. J., 181 Beeri, C., 4, 5, 18, 25-27,29~32~

35-37, 49, 53, 54, 69,70,73, 77,99, 101-104, 107,109,112, 113, 118, 130, 318, 334,335,

339 Bernstein, P. A., 4, 18,26,30.69,

70,73,74,81,84,99-102,105, 113,120,130,318,339

Bishop, C., 142, 156, 163 Biskup, J.,14,26, 31, 32, 70, 299 Blasgen, M. W., 265 Bochvar, D. A. 343 Bole, L., Boyce, R. F., Brzozowski, J. A.,

189, 364 4, 237, 258

258

de Carvalho, R. L., 160, 181 Carlson, C., 6, 18, 107, 113 Chamberlin, D. D., 21, 258 Chang, C. L., 7,11,12,19,196,199,

200,230,235,237,241,242,247, 249,252,257,258,265,277,290, 291,294,296,297,306,322,336, 339,368,394,400,413

415

Chandra, A. K., 56,57,70 Clark, K. L., 160,173,181 codd, E. F., 4,14,19,26,28,30,56,

70,73,77,80,99,101-103,110, 114,235,236,255,258,260,265, 299,300,316,319-321,338-340, 367,368,371,372,392,394,399, 413,419

Colmerauer, A., 15,181,343,346, 361,364,393,394

Colombetti, M., 10,19,160,181 Courcelle, B., 163,181

Date, C. J., 4,10,19,27,70,138, 156,303,340,411,413

Dayal, U., 26,70,74,81,100 Delobel, C., 26,30,31,38,69,70,

73,77,79,100,103,114 Demolombe, R., 16,230,367-369,376,

378,394,399,413 Denning, D. E., 17,19,409,410,413 Denning, P. J., 17,19,409,410,413 DiPaola, R., 368,370,371,394 Doyle, J., 14, 19

Elliott, R. w., 291,294 van Emden, M., 10,159,160,166,167,

181 Eswaran, K. P., 258

Fagin, R., 5,6,20,26,27,30-32,35, 37,49,57,70,71,73,77,81,99, 100,102-104,109,110,112-114,

303,340

Ga11aire, H., 3,7,10,11,19,20, 157,181,231,235,258,259,294, 295,302,305,331,340,341,364,

395,414

416

Goguen, J. A., 10,20,161-163,181, 182

Goodman, N., 4,18,101,102,113, 130,318,339

Gotlieb, L. R., 178,182 Grant, J., 11,12,14,18,195,226,

230,277,294,300,340 Gray, J. N., 258 Griffiths, P. P., 258 Guttag, J. V., 10,20,159-162,182

Hall, P.A.V., Hammer, M. M., Hayes-Roth, F., Heliard, J. C.,

318,328,340 258 294 181

Hermes, H., 315,340 Hilbert, D., 142,156 Hitchcock, P., 318,328,340 Hoare, C.A.R., 159,160,182 Hoffman, C., 180,182 Honeyman, P., 109,113 Hopcroft, J., 12, 20 Horning, J. J., 159,160,182 Howard, H. J., 26,27,30-32,37,49,

54,70,77,99,103,104,109,113 Huet, G., 163,182

NAME INDEX

Lacroix, M., 15,20,237,259, 333,340

Lampson, B. W., 159, 182 Lankford, D., 163,182 Lee, R.C.T., 7,19,237,242,306,

322,336,339,397,400,402,413 Lee, R. M., 414 Lemke, J., 333,340 Levy, M. R., 161,162,182 Lipski, W., Jr., 14,20,302,340 Liskov, B. H., 159,160,183 Lockemann, D. C., 178,183 London, R. I., 183 Lorie, R. A., Loveland, D. W., Lyndon, R. C.,

21,258 7,20

353,364

Maibaum, T.S.E., 10,159,178,181, 183

Maier, D., 6,26,30,31,42,56,60, 61,71,74,100,101,111,112,114

MCJones, P. R., 258 McSkimin, J. R.,10,20,142,143,155,

157,231,368,379,394,399,414 Mehl, J. W., 258 Melkanoff, M. A., 6,115,117,119,

126,128,130,131 Ichbiah, J. D., 181 Mendelzon, A., 6,26,29-32,42,56,

60,70,71,100,101,111-114 Janas, J., Janssens, D.,

16,397,404,413 5,71,73

Kaplan, S. J., 397,414 Karttunen, L., 343,364 Keenan, E. L., 343,364 Kellogg, C. H., 11-13,20,138,15~

196,199,230,231,235,259,261, 263,290,294

Kuhns, J. L., 368, 394 Kim, W., 12,20,228,230,231 King, W. F., III, 258 Klahr, P., 20,156,230,235,259,

263,276,294 Kowalski, R. A. , 138,153,157,160,

166,167,181,182,242,259 Krieg-Bruechner, B. , 181 Kuehner, D. , 167, 182

Merlin, P. M., 56,57,70 Minker, J., 3,7,10-12,16,19,20,

138,139,142,143,155,157,181, 195,196,198,226,228,230,231, 235,258,259,277,294,295,302, 305,331,340,341,364,368,379,

394,395,399,414 Mostowski, A., 349-364

Navathe, S. B., 333,340 Nicolas, J. M., 3,7,20,26,30,35,

71,74,79,100,235,259,302, 305,331,340,341,368,371,394,

414 Nilsson, N. J. , 198,231 Nivat, M. , 183

O'Donnell, M. , 163,180,182,183

NAME INDEX

Paolini, P., 19,181 Paredaens, J., 5,26,30,31,38,71,

77,78,79,100 Pasero, R., 343,364 Pelagatti, G., 19,181 Pequeno, T. H. C., 181 'Pereda-Borquez, A. A., 181 Pereira, L. M., 257,259 Perrault, R., 20 Pichat, E., 79,100 Pique, J. F., 15,343,347,364,395 Pirotte, A.,15,16,20,237,259,333,

Powell, P. B., Price, T. G., Potzolu, G. R.,

340,368,395 231

21 258

Reiter, R., 8,10-12,14,16,20,21, 137-139,142,156,157,196, 199-201,231,235,259,295,331, 332,341,361,364,368,370,395,

402,414 Rescher, N., 343,365 Rissanen, J. 6,21,26,30,35,70,71,

74,81,100,101,102,105,107, 109,112-114

Robinson, J. A., 7,21,322,341 Rosen, B. K., 163,183 Roubine,O., 181 Roussel, P., 11,21,362,365 Rustin, R.,70,99,340,387,394,413

Sadri, F.,5,6,21,26,71,74,100,101 Sagiv, Y.,26,29-31,56,57,60,

69-71,101,110,112-114 Sciore, E., 26,31,69,71,112,114 Selinger, P., 12,21,201,229,230,

232 Shaffert, C., 183 Shaw, M., Sickel, S., Silva, A. M., Slagle, J. R., Smith, D. C. P., Smith, J. M., Stonebraker, M.,

Synder, A.,

159,183 259,277,295

6,115 242,258 255,259 255,259

16,21,263,295, 410,414

183

417

Tarnlund, S. A., 160,173,181 Thatcher, J. W., 181 TOdd, S.J.P., . 318,328,340 Traiger, I. L., 258 Travis, L., 12,13,20,156,230,231,

259,261,263,294

Ullman, J. D., 4,5,6,8,10,12,20, 21,26,29-31,36,56,57,69-71, 74,100-102,104,112-114,201, 229,230,232,303,334,335,339,

341

vardi, M., 5,25,32,49,71,111-114 Vassi1iou, Y., 14,21,309,341 Veloso, P.A.S., 181 Vui11emin, J., 183

Wade, B. W., Wagner, E. J., Warren, D. H., Warsha11, S., Waterman, D., Watson, V., Wright, J. B., Wichmann, B. A., Wilson, G., -Woh11eber, W. H., Wong, E., Wu1f, W. A.,

Yannakakis, M., Yao, S. B., Yasuhara, A., Yeh, R., Youssefi, K.,

258 181

257,259 282,295 259,294

258 181 181

228,232 178,183

239,260,410,414 183

112,114 230,232

306,322, 336,341 181

239,260

zadeh, L., 295 zanio10, C., 26,30,71,73,100,103,

114,115,117,119,126,128, 130,131,333,341

Zanon, G., zi11es, S., Zloof, M. M., Zuber, R.,

18,393 10,21,159,160,183

237,260 343,365

SUB.JECT INDEX

A-cover, 116,118-121,129,130,132 Atomic component, 115-133 Abstract data types, 10,17,19,20, Atomic formula, 7,164

159,160,175 Atomic query type, 195,205-208, Abstraction mechamisms, 183 212,213,221,222 Access control, 398,410,414 ATTR, Access mechanisms, 195,205,206,

209,212,218,221,227 Access path selection,21,229,232 ADA, 181 ADJ, Algebra Algebraic specification

of da ta types, Algebraic specification

method, ALPHA, ALPHARD, AND/OR problem solver, ANSI/X3/SPARC Study Group

on Data Base Management

180,181 161

183

183 399 183 198

Systems, 339 Answer and Reason extraction 231 Answer completion, 13,16 Artificial Intelligence, 196,231 ASC (attribute set

27

definition of, 27 Attributes,

definition of, 27,74,178 Attribute set, 27,29,116,119,125 Augmentation rule, 32 Automata theory, 245,258 Automated tools, 161 Axiom, 26,31,163,195-198,204,205,

207,222 Backward chaining, 276 Backward reasoning, 263,275 Base relation, 235,240,265 Batched queries, 197,200,228,229 BCNF, (Boyce codd Normal Form), 4 Bidirectional reasoning 263 Binary crosses, 38 Binary jd (join dependency) , 30 Boolean algebra, 343 Boolean category of

expressions, Boolean matrices, collection) ,

Armstrong relation, Assertions, Assignment,

6 Boolean rules, 198 Boolean sort,

143 295

32 163 355 162 Bound occurring variables,

419

420

Bound variable, Boyce Codd Normal BRANc(X), (branch Branch-and-bound, Branch basis, Branch complete,

400 Form, 4 basis of X) ,50

12

Branch intersection rule, Branches,

50 54 43

26,41 41 BRx(Ri ), (X branch of Ri ) ,

C=D-comparison, 329 C=W-selection, 326 canonical form, 164,168-170 Carrier of the algebra, 161 Chain of reasoning, 221,225 Chase, 27,60 Chase process, 31 Church-Rosser theorem, 164,183 clausal form of logic, 165,166 Clause, 8,159,164,171 clause inter-connectivity

graphs, 295 Closure, 164 Closed world assumption, 332,402 Closed world data bases, 341,364,

414 CLU, 32,159 Clustered, 203,229 coalesced cost, 218,219 coalescings, 205,206,220,228,229 CODASYL type data bases, 397 Coherent expression, 399-407 Combinations,117,119-l22,124,127 combination rule, 321 Combined relationship, 119,120,

126-128 Common atomic formula, 141

SUBJECT INDEX

Complete three-valued logical system,

Completeness of the 364

projection rule, 36 Composition, 28 Compound query, 200,228 Concept graph, 282 Conceptual model, 130 Conditional equations, 161 Conditioned type equations, 163 confluent, 164,182 Confluent reductions,

Congruence, Congruence class, conjunction list, conjunction order, conjunctive existential

182

162 166 217 217

237,238 queries, conjunctive Conjunctive conjuncts,

form, 199 query, 56,329 195,198,201,213-216,

222-226 Connected components, 209,214 Connected expression, 399,400 Connection graph,242,244,245,258,

259,277-279 Consequence verification, 173 Constraints, 25,26,29,74 Constraint expression, 410,411 contained,

defini tion of, 29 Containment mapping, 57 Context-free grammar, 244 Control structure, 253 Controlling recursive premises,

261 Common literal, 141,147,152 Cooperative responses, 414

319 181 203

Common predicate sign, 140 correct, Compiled, 11,199 correctness, Compiler approach, 198,199,228, cost formulae,

277 costs, complementation rule, 32 complete, 31,319,321,350 complete axiomatization-

functional and multivalued

covering, Covering rule, Covers S, creating indices,

dependencies Complete formal system,

99 cross, 26

205,206,209,228 79 33 33

229 5,30,78,82

SUBJECT INDEX

DADM (see Deductively Augmented Data Management)

Data abstractions, 159,183,259 Data models, 160 Data security, 19,409,413 Data structure, 162 Data types, 21,160,161,182 Database administrator, 204,220 Database design, 3,102 Database designer, 115,116,121,

130 Database normalization theory,

339 Database operation, 319 Databases, 178,196 Database specification, 178,183 Database reorganization, 205 Database sub1anguage, 413 Database systems, 413 Decision procedure, 142 Decomposable, 35 Decomposition, 101,230,239 Decomposition of relations, 4,6 Decomposition of schemes, 35 Decomposition property, 73 Decomposition rule, 32 Deduce, 236,237,258 Deduce 2, 230,258,294 Deduce query, 241,245,257 Deduction, 3,7,9,11,364

comp:i1ed, 11,199 interpretive, 11,198,199,222,

228,277 Deduction in 3-va1ued logic, 360 Deduction of confidential

information, 409,410,412 Deduction over relational

data bases, Deduction relation F ' Deductive capability, Deductive data base, Deductive first order data

235 359 196

12,17

bases, 138 Deductive p1anning,12,20,230,259 Deductive query language, 258 Deductive question-answering, 20,

143,157,231,259,294,295 Deductive relational data base

systems, 195,231,294

421

196 200,228,230

200,204

Deductive searches, Deductive queries, Deductive systems, Deductively Augmented Data

Management, 261,262,263,266,276, 277,288,292,293

deductive processor, 262,279 performance features, 281 system overview, 276 user interaction, 264

Default reasoning, 20 Defined query, 370-372 Definite clause, 165,167 Definite Horn clause, 8 Definite sentence, 165 Deletion anomaly, 4 DEP(C) ,

def!nition of, 49 Dependency, 5,19,21,26,29,115-118,

121,126 Dependency basis, 27 Dependency structures, 99 Derivation, 31 Derive, 163,167 Derived relation, 235,240,257 Derived rules, 26 Design tool, 182 Difference, 331 Direct subquery, 400,403,412 Disjoint general dependency, 96 Disjunctive normal form, 200,201 Disjunctive prenex normal form,

400 Disjunctive query, 302,329 Distinguished, 56 Distributed database, 409 Distributive lattice, 315 Division, 331 Domain, 27,74,115,117,121,122,124,

126,303,304,378-384,387 Domain siz'e, 121,128,130 Dynamic indexing, 229 Dynamic integrity constraint, 404

EJ-axiom (embedded-join EJD~ (EJ axiom) , EJD1 (covering rule) , Embedded, Empty clause,

axiom) ,33 33 33

26,30 165

422

Equality relation, 137 Equations, 159,160,162,171,183 Equational specification,160,163 Equational sentence, 165 Equi-join, 201 Equivalence classes, 40 Equivalence relation, 40 Equivalent, 6,29 Equivalent conjunctions, 213-215

221-225 Equivalent instant, 214 Error values, 180 Estimated optimal conjunction

orders, 221,228 Estimated optimal evaluation

method, 213,220,221,228 EUCLID, 159,182 Evaluable query, 367-369,372,376

378 Evaluation, Evidence chains,

75 264

Executor, 206,221,224 Existential null value, 336 Experimental relational

data base, 231 Extended projection of ~ on S,40 Extended projection rule, 40 EXtensional data, 261,262

Fact retrieval system, 294 Failure, 175,180 FD (see Functional dependency) Free-occurring variables, 355 Final schema, 116,118,131 First order data base, 139 First order hierarchical

decomposition, 5,30,78,82 First order predicate calculus,

5,16,56,196,299,306,399,400 FOHD (see First order hierarchi-

cal decomposition) Formal specification, 182 Formal system, 26,31 Forward chaining, 276 Forward reasoning, 263,275 Fourth normal form, 5,110 Free variable, 400,404 Freely generated, 162 Full jds (join dependencies), 31

SUBJECT INDEX

Function free data bases, 140 Function free Horn axioms, 201 Function symbols, 164 Functional, 26 Functional dependency (FD),

5,6,30,73,77,82,101,115, 117-122,124,125,127-131,204

Functionally complete, 160 Fuzzy sets, 295

General cross, 38 General decompositions, 87 General dependencies, 5,73,76,82 General laws, 3,7-9 General problem solver, 198 Generalized access cost equations,

230 Generalized join, 299,301,340 Generalized multivalued

dependency, 77,82 Generalized tip node, 250,253 Generalized relation, 14,304 Generalized transitivity subset

rule, 47 Generalized tuple, 302,303 Generated by a set of equations,

162 Global decisions, 199 Global optimization, 195,199,214,

GlObal GlObal Ground Ground

optimizing algorithm, solution, atomic formulae, literal,

228 195 205 138

7

Herbrand base, 166 Hidden functions, 178 Hierarchical dependencies, 100 Hierarchical tree, 255 Hierarchy of indexing, 227 Homomorphisms, 162 Horn, 8,9 Horn axiom, 196 Horn clause, 8,9,19,159,160,165,

241 Horn formula, 153,154

Idempotence, 29 Identity operator, 28

SUBJECT INDEX

Ill-defined query, 16,367,368 Image, 332 Implicitly defined, 196-198,223 Implicational dependency, 5 Implies, 31 Improving answers, 414 Incomplete information, 261,340 Incomplete knowledge, 319 Inconsistency, 144

with the Typed Data Base (TDB) , 152

Indefinite clause, 8 Independent components, 105 Indexing, 195,202,203,205,209,217,

218,229,230,233,234 Indexed existential null value,

336 Indexing hierarchy, 204,233 Indirect recursion, 292 Inferences, 167,231,400,409,410 Inference control, 410 Inference plans, 263,264,266 Inference rules, 31,73, 82 Inferential relational

system, 231 Inferring an informative

answer, 398 Infinite reduction, 175 Infinite trees, 181 Information content, 318 Informative answers, 397 Informative capabilities, 3,13 Informative user interface,398,

414 INGRES, 16,21,263,295 Inheritance property problem, 255 Initial algebra, 160,162,181 Input clauses, 167 Input lines, 75 Insertion anomaly, 4 Instance, 116,117,119,124,130,

132,133,166,178 Instances of equivalent

conjunctions, 228 INT(W) , 143,144 Integrity, 3,7,9,10,21,137,143

constraints, 9,10,29,73,100, 137,138,140,143,145,146,154, 397,398,404-409

data base, 144

423

Intensional data base, 262,264 Interdependency, 79,82 INTERLISP, 263,278,294 Intermediate indexes, 202 Interpretation, 56,166, 353-356,

J c (x) ,

definition JD (see Join

of, dependency)

359,370

50

Join, Join dependency,

Join support,

28,75,23: 5,17,24,29,81,

82,.11: 203-205,212,227,

229,233,23< Join term, 400,4m Join-supported ]OlnS, 195,206,

211,215,218,221,223,224,22;

K-ary cross, 38 Keys, 120 Knowledge-based systems, 196

Language structure group of the CODASYL development committee,

340 Large shared data banks, Least element, Least fixpoint, Left and right side, Left side of the mvd, Linear resolution with

99,258 166 167

26 34

selection function, 167,182 LISP, 259,266,278 Literal, 7 Local decisions, 199 Local optimization, 228 Local solution, 205 Logic, 160,231 Logic and data bases, 230,231 Logic definition, 169 Logic for problem solving, 182 Logic programs, 167,173 Logical implication, 311 Look-up, 217 Loss1ess decomposition, i--

Lossless join, 26,102,334 LUSH resolution, 167

424

MANY (R) , 35 Many-to-many relationship,

121-132 Many-to-one relationship,

120,123-129,131,132 Many-sorted algebra, 161 Many-sorted logic, 16 Many-valued logic, 365 Matching condition, 321,322,333 Maybe operation, 320 MD (see Multivalued dependency) Meaningful query, 399 Mechanical Theorem Proving

(see Theorem proving) Merging, 176

SUBJECT INDEX

Noetherian, Non-clustered indexing, Non-coherent expression, Non-Horn clause, Non-loss decomposition of

164,175 203,229 402,403

8

r ela tions , 5 Non-procedural, 257 Normal forms, 19,100,102,164 Normalization theory, 18 Null value, 14,18,21,299,302,303,

OBJ, Objects, ONCE(R) ,

340,341

161 161

35 Merging scan method, Metamorphosis grammar,

229 One and two variable queries,230 181,261, One-to-one relationship,

364 120,122,123,128,129 Middle term chaining, 276 Open world assumption, 332,402 Minimal cover, 118 Operators, 161 Minimal redundancy, 118 Optimal conjunction order,213,215 Missing value, 299 Optimal evaluation method,218,224 Mixed rules, 37 Optimizing queries, 195;202,218, Mixed subset rule, 32 228,229,232 Model, 166 Optimization algorithm, 11 Model intersection, 160,166 Optimization problem in rela-Model of the formula, 306 tional data, 258 Monadic predicate calculus, 142 Optimizer, 195,197,199, Monadic relation, 137 203-206,209,212-215,220-222, Monotonicity, 29 225-227,229 Monotone functions, 167 Outer union, 315,329

75 Motorola 6800 micro-computer,362 Outputline, MRPPS (Maryland refutation

proof procedure system) 16,277 Multiple recursion, 291 Multivalued dependency,

5,6,26,30,77,82,100, 103,115,118-120,126,128-130

Mutual dependency, 78,82,100 MVD (see Multivalued dependency)

Natural join, Natural language,

321 12,231,343,

344,364 Natural logic, 343 Negative clause, 165 Negative information, 331 Negative variable, 372,382,387 Nested loops method, 229

page accesses, PAR, Partial correctness,

203,228,233 232 173

partial covering, 79 Partial open world assumption,332 Partial ordering, 309,310 Partially ordered set, 167 Partly specified information, 292 Partition, 40 pathfinding, 20,230,259,278 Pattern matching PROLOG program

for translating equations to a logic program, 192

PJNF (see project Join Normal Form)

Plausibility weights, 268

SUBJECT INDEX

positive variable, 372,382,387 predicate argument type

constraint, 143 predicate calculus (see first

order predicate calculus) predicate logic (see first

order predicate calculus) predicate logic programming

language, 11 Predicate symbols, 164 preferred methods, 217,218,221,

224,228 premise selection techniques,276 Premiss, 162,164 Prenex normal form, 145 preprocessor, 195,204-206,

212-214,221,222,225-227 presupposition, 15,343,346,347,

364 Presupposition operator "if",345 primary key attributes, 399 primitive access method, 214 primitive conditional, 281 primitive categories, 143 procedural complete relation,265 Product, 316 Product operation, 338 program development, 159,160 Program schemata, 253,254 project join expression, 29 Project join normal form, 5 projections, 28,74,117,229,311,

320 projection dependencies, 35 projection of C on S, 35 Projection of ~ on S, 38 projection-substitution rule, 47 PROLOG, 11,18,159-161,168-170,

173,176,257,259,362,365 proof of correctness of data

representation, Proof procedure,

182 259,261,262

Qualification expression, 399, 402-405,408,409,411,412

Quantifier, 145,343,346,349 Quantifier-free form, 201 Query by Example, 260 Query graph, 239

425

Query interpretation, 13,15,16 Query modification, 410,414 Query simplification, 409 Question answering system, 343,

Quotient, Quotient algebra,

344,364 162 167

Range declaration, 299,302,306 Range-seprable, 399 Rearrangement,119,120,129,131,132 Reasoning steps, 225,226 Reasoning with data, 261 Recursive equations, 181 Recursive general laws, 12 Recursive polyadic schemes, 183 Recursive premises, 289,291 Recursive query graph, 253 Reduced, 79 Reduced type normal form, 150-153 Reduction, 40,163,169,175 Reduction system, 164 Reflexivity, 165 Reflexivity axiom, 32 Refutation, 167,168 Regular axioms, 254,257 Regular expression, 245,247 Regular rules, 244,246 Regular value, 303 Relation, 116-118,121,122,124,

126-128, 129-131, 195 completely explicit, 204 completely implicit, 203 explicit 196-199,206 partially explicit and implicit,

198,204 partially implicit 225 partly or completely implicit,

206 Relational algebra, 28,178,228,

263,299 Relational calculus, 228,397,399,

413,414 Relational calculus based

language, 397 Relational completeness, 413 Relational completeness of data

base sublanguages, 340 Relational data management

system, 230,261,263

426

Relational database, 175,195, 197,200,230,231

Relational database model, 73,110,232

Relational database schemas, 25,74

Relational database systems, 196,198,199,228,230,231

Relational data model, 160 Relational expression, 28,171 Relational equivalent, 171,172 Relational formula, 238 Relational model, 26,27,99, 399 Relational operators, 14 Relation instance, 74 Relation system, 306 Relations, 27,195 REP (A) (repeated variable) , 59 Repeated variable, 59 Representative, 310 Resolution, 361 Resolution plans, 258 Resolution principle, 21,341 Restricted existential

quantifier, Restricted quantifier, Restricted relational

expressions, Restricted universal

141 149

28

quantifier, 141 Restricted variables,

372,374,382,387 Rewriting rules, 241,243,245,258 Right side of an MVD, 37,41 ~ws 27 RRE 50 Rules, Run-time executor, satisfaction, Satisfies, Schema design, Search strategy, Security, Selected atom, Selections, Selection function, Semantic advice, Semantic checking of

questions,

26 197 162

29,75 26

231 398 167

229,326 231

261,292

413

SUBJECT INDEX

Semantic counting information,225 Semantic deduction, 360

163 Semantic information, Semantic integrity

constraint, Semantic knowledge,

Semantic meaning,

10 195,204,

206,221-224 312

Semantic network, 20,157,231,414 Semantics of data types, 181 Semantics of logic, 165 Semantics of nondeterminism, 183 semantically related

conjunctions, 223,225 Semantically related tables,

223,226 Semantics, 353 Sentence, Set of types, Sets, Set difference, Set operations, set union, Simple types, Skolem constant, Skolem function, SL resolution (see linear

7,164 141 175 176 231 176

140,143 322,336

7

resolution with selection function)

SLD resolution, sort, Sound,

167,168,170,175 161,162,229,230

31 Special value, Specification, Specification techniques, SQL, SQUARE, Static integrity constraint, statistical data base,

300 181 183 229 258 404

17 Stems, Structure sharing, Structure sharing in the

26,41 261,289

problem graph, 288 Structured programming, 159 STx(Ri) (X-stem of Ri) , 41 Substitutions, 166,167,230,307 Substitution rule, 37 Substi tutivi ty, 170 Subset rule, 32

SUBJECT INDEX

Subquery, Successor arithmetic, Summary of a Tableaux, Supportive chains,

398-410 174

56 274

Symbolic logic (see First order predicate calculus)

Symmetry, 165 Syntax, 162,352 Syntax of data base formulae,141 Synthesizing third normal

form relations, Synthesizing programs for

99

queries, System R,

245 229,236,257,258

T-completeness assumption, 143 T-completeness property, 142 T represents E, 57 Table,

conjunction lists, 213-216, 221,223,224,226,228

explicitly given, 203,224 lookup, 209

Tableau, 27,56 Taxonomies, 163 Template dependencies, 5,100 Term, 7,164,237,352 Term rewriting systems, 182 Termina tion, 175 Termination problem, 235 Third Normal Form (3NF), 4 Three (3) value Boolean

algebra, 349 Three (3) valued Boolean

function, Three (3) value

Theorem proving,

Theory of joins, Tip node, Top-down search, Total,

logic, 350,351 14,15,

343,344 11,19,20,196,

198,258,339 339

Total join dependency, Translation,

239 11

26,30 5

169 32

169,172 282

Translation rule, Translating equations, Transitive closure, Transitive closure matrix, 267,

288

Transitive dependency, Transitivity,

427

Transitivity rule, Tree-manipulating systems, Trivial jd (join dependency), 34 Trivial general dependencies,

79,82,100 165,170

32 183

73,82,89,90 Truth maintenance, Truth values, TUple,

19 161

27,178 357 343 149

language, 144

TwO-truth values, TwO (2) value logic, Type literals, Typed programming Types, 143,162 Typed data base,

Typed first order

Typed normal form,

138,140,142, 143,146,150

data bases, 10, 21,137,414

137,146,149, 150,154

Typed well formed formulae (TWFFs) , 141,147

Unconnected expression, Undecomposable relations, Undirected graph, Undistinguished variables

in a tableaux, Unevaluable query, Unification, Unifier, Uniform distribution, Uniform halting problem, Union, Union rule, unique disjoint general

dependency, Universal relation schema,

400 100

208,214

56 370,378

322 9,166

202 182 327

32

96 115-118,

131 Universe, 83 Universal relational assump-

tion, 333 Unrestricted variable,372,374,387 Update, 178 User's access rights, 398 Vacuous twff, 150 Value relation, 306 Variables, 162,164

428

Variable-free atomic formulae, 166

variable relation, 59 Verification, 160 Verification of programs, 182 Very high level programming

language, 160 Virtual (deduce) relations, 265 Voice output, 231 Warsha11's algorithm, 282 Weakened universal relation

assumption, 333 Well-defined query, 16 Well-formed formulae, 7

X-branch, 41 X-stem, 41 X-valued, 27

Yes/No DEDUCE query, 251 Yes/No queries, 251

Zanio1o-Me1kanoff algorithm, 115,116,118,119,128,130,131

z-cover, 116,118-122,124-126,128-132

Z-expansion, 315

SUBJECT INDEX

LIST DF REFEREES

The editors are indebted to the referees for their detailed reading and constructive comments. Every article was reviewed by at least three reviewers. The quality of each article has been enhanced over the original submission due to their efforts.

W.

F.

c.

J.

M.

A.

C.

R.

M.

R.

H.

J.

J.

P.

w. Annstrong

Bancilhon

Beeri

Biskup

Brodie

Colmerauer

Delobel

Demolombe,

van Emden

Fagin

Gallaire

Grant

M. Janas

Kandzia

Universite de Montreal, Canada

INRIA, France

Hebrew University, Israel

Technische Hochschule Aachen,

Federal Republic of Gennany

University of Maryland, USA

universite de Marseille, France

Universite de Grenoble, France

CERT, France

University of Waterloo, canada

IBM, USA

ENSAE-CERT, France

Towson State University, USA

Hochschule der Bundeswehr MUnchen,

Federal Republic of Gennany

Christian Albrechts Universitat,

Federal Republic of Gennany

429

430

C. Kellogg

H. J. Klein

R. ~. Kowalski

M. Lacroix

M. Leonard

W. Lipski, Jr.

D. Maier

A. Mendelzon

J. Minker

J. M. Nicolas

P. Paolini

J. Paredaens

E. Pichet

J. F. pique

A. Pirotte

R. Reiter

J. Ris'sanen

Y. sagiv

S. A. Tarnlund

L. Travis

M. Vardi

D. Warren

G. Zanon

LIST OF REFEREES

SDC, USA

Christian Albrechts Universitat,

Federal Republic of Germany

Imperial college of London,

Great Britain

Philips Research, Belgium

universit~ de Geneve, Switzerland

polish Academy of Science, Poland

State University of New York,

Stony Brook, USA

IBM, USA

University of Maryland, USA

ONERA-CERT, France

lEE Politecnico di Milano, Italy

Universitaire Instelling Antwerpen,

Belgium

Universite de Grenoble, France

Universit~ de Marseille, France

Philips Research, Belgium

University of British columbia,

Canada

IBM, USA

university of Illinois, USA

University of Upsala, Sweden

University of Wisconsin, USA

Weizmann Institute, Israel

university of Edinburgh,

Great Britain

CERT, France

ADDRESSES OF CONTRIBUTING AUTHORS

C. Beeri Department of Computer Science Institute of Mathematics The Hebrew University

of Jerusalem Jerusalem, Israel

J. Biskup Lehrstuhl fur Angewandte Mathematik/INSB Informatik RWTH Aachen Templergraben 55 D-5l00 Aachen Federal Republic of Germany

C. L. Chang IBM Research Laboratory-K54/282 5600 Cottle Road San Jose, california 95193 USA

A. Colmerauer Groupe d'Intelligence

Artificielle Universite d'Aix

Marseille II Marseille Luminy 70, Route Leon Lachamp 13009 Marseille France

R. Demolombe ONERA-CERT Department d'Informatique 2, Avenue Edouard Belin 31055 TOulouse Cedex France

M. van Emden Department of Computer Science University of Waterloo Waterloo, Ontario, canada

H. Gallaire ENSAE BP 4032 31005 TOulouse cedex, FRANCE

J. Grant TOwson State University Department of Mathematics

and Computer Science TOwson, Maryland 21204 USA

J. M. Janas Fachbereich Informatik Hochschule der Bundeswehr-Miinchen Werner-Heisenberg-Weg 39 D-80l4-Neubiberg Federal Republic of Germany

431

432 ADDRESSES OF CONTRIBUTING AUTHORS

D. Janssens Universiteit Antwerpen Department Wiskunde Univeriteitsplein 1 B 2610 WILRIJK Belgium

C. Kellogg

J. Paredaens Universiteit Antwerpen Department Wiskunde Uni versi tei tspl'ein 1 B 2610 WILRIJK Belgium

J. F. Pique Groupe d'Intelligence Artificielle Universite d'Aix Marseille II Marseille Luminy

System Development corporation Research & Development Division 2500 colorado Avenue 70, Route Leon Lachamp

94406 USA 13009 Marseille France Santa Monica, California

T. S. E. Maibaum Department of Computer Science University of Waterloo Waterloo, ontario, Canada

D. Maier Department of Computer Science State university of New York Stonybrook, New York 11794 USA

M. A. Melkanoff Computer Science Department university of california, UCLA Los Angeles, California 90024 USA

A. O. Mendelzon University of TOronto Department of Computer Science TOronto, canada H55 lA7

J. Minker Department of Computer Science University of Maryland College Park, Maryland 20742 USA

J. M. Nicolas ONERA-CERT Department d'Informatique 2, Avenue Edouard Belin 31055 TOulouse Cedex France

R. Reiter Department of Computer Science University of British Columbia Vancouver BCV GT 1 W5 Canada

F. Sadri Computer Science Department Stanford University Stanford, California·94305 USA

A. M. Silva Computer Science Department University of California, UCLA Los Angeles, california 90024 USA

L. Travis Department of Computer Science University of Wisconsin Madison, Wisconsin USA

J. D. Ullman Computer Science Department Stanford University Stanford, california 94305 USA

M. Y. vardi Department of Computer Science Institute of Mathematics The Hebrew University of Jerusalem Jerusalem, Israel