Table Of Content

NS, pan THE JOURNAL OF sh LOGIC PROGRAMMING ELSEVIER The Journal of Logic Programming 40 (1999) 299 Author Index — Volume 40 (1999) (The issue number is given in front of the page numbers) Bostrom, H., and P. Idestam-Almquist, Induction of logic programs by example-guided unfolding (2/3) 159-183 Brass, S., and J. Dix, Semantics of (disjunctive) logic programs based on partial (1) 1-46 evaluation (2/3) 185-213 Camacho, R., see Srinivasan, A. (1) 1-46 Dix, J., see Brass, S. (2/3) 215-249 Gamberger, D., see Lavra¢, N. Gonzalez-Moreno, J.C., M.T. Hortala-Gonzalez, F.J. Lopez- Fraguas and M. Rodriguez-Artalejo, An approach to declarative programming based on a rewriting logic (1) 47-87 Greiner, R., (2/3) 273-298 The complexity of revising logic programs (1) 47-87 Hortala-Gonzalez, M.T., see Gonzalez-Moreno, J.C. (2/3) 159-183 Idestam-Almquist, P., see Bostrom, H. (2/3) 215-249 Jovanoski, V., see Lavrac, N. Lavra¢, N., D. Gamberger and V. Jovanoski, (2/3) 215-249 A study of relevance for learning in deductive databases (1) 47-87 Lopez-Fraguas, F.J., see Gonzalez-Moreno, J.C. Lucio, P., F. Orejas and E. Pino, An algebraic framework for the definition of compositional (1) 89-123 semantics of normal logic programs Muggleton, S. and D. Page, (2/3) 125-126 Guest editors’ introduction (1) 89-123 Orejas, F., see Lucio, P. (2/3) 125-126 Page, D., see Muggleton, S. (1) 89-123 Pino, E., see Lucio, P. Rieger, A.D., (2/3) 251-271 Optimizing general chain programs (1) 47-87 Rodriguez-Artalejo, M., see Gonzalez-Moreno, J.C. Srinivasan, A., and R. Camacho, Numerical reasoning with an ILP system capable of lazy eva- (2/3) 185-213 luation and customised search Taylor, K.., Generalization by absorption of definite clauses (2/3) 127-157 0743-1066/99/$ — see front matter © 1999 Elsevier Science Inc. All rights reserved. PII: S0743-1066(99)00055-2 THE JOURNALO F LOGIC PROGRAMMING ELSEVIER The Journal of Logic Programming 40 (1999) 301 Subject Index — Volume 40 (1999) (The issue number is given in front of the page numbers) Absorption, (2/3) 127 Inductive Logic Programming, (2/3) Chain programs, (2/3) 251 127, 185, 215, 273 Compositionality, (1) 89 Institutions, (1) 89 Computational complexity and approxi- Lazy evaluation, (2/3) 185 matability, (2/3) 273 Lazy narrowing, (1) 47 Concept learning, (2/3) 215 Model-theoretic semantics, (1) 89 Constructive negation, (1) 89 Modular logic programs, (1) 89 Constructor-based rewriting logic, Monotonic semantics, (1) 89 (1) 47 Non-deterministic functions, (1) 47 Cost-sensitive literal reduction, (2/3) Normal logic programs, (1) 89 215 Numerical reasoning, (2/3) 185 Covering, (2/3) 159 PAC-learning, (2/3) 273 Customised search, (2/3) 185 Prefix elimination method, (2/3) 251 Declarative programming, (1) 47 Program transformation, (2/3) 251 Divide-and-Conquer, (2/3) 159 Relevance of literals and examples, Example-guided unfolding, (2/3) 159 (2/3) 215 Forward inferences, (2/3) 251 Resolution, (2/3) 159 Generalization, (2/3) 127 Theory revision, (2/3) 273 Induction of logic programs, (2/3) 159 0743-1066/99/$ — see front matter © 1999 Elsevier Science Inc. All rights reserved. PII: S0743-1066(99)00053-9 ( e wee a e : 1 ENC io RENE Lee E e a e e N S