Авторизация
Поиск по указателям
Nienhuys-Cheng S., Wolf R. — Foundations of Inductive Logic Programming
Обсудите книгу на научном форуме Нашли опечатку?
Название: Foundations of Inductive Logic ProgrammingАвторы: Nienhuys-Cheng S., Wolf R. Аннотация: Inductive Logic Programming is a young and rapidly growing field combining machine learning and logic programming. This self-contained tutorial is the first theoretical introduction to ILP; it provides the reader with a rigorous and sufficiently broad basis for future research in the area. In the first part, a thorough treatment of first-order logic, resolution-based theorem proving, and logic programming is given. The second part introduces the main concepts of ILP and systematically develops the most important results on model inference, inverse resolution, unfolding, refinement operators, least generalizations, and ways to deal with background knowledge. Furthermore, the authors give an overview of PAC learning results in ILP and of some of the most relevant implemented systems.
Язык: Рубрика: Computer science /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Издание: 1Год издания: 1997Количество страниц: 410Добавлена в каталог: 13.12.2013Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
182 120 77 see Abduction 173 Accuracy 357 Ade, H. 171 197 346 347 357 Admissible (pair of languages) 182 183 Admissible PAC algorithm 324 Adversarial noise 331 see Aha, D. 357 AI see "Artificial intelligence" Akiba, S. 197 Alexin, Z. 357 Algorithm 55 Allowed clause 142 335 347 Allowed set of clauses 142 153 335 Alphabet 4 18 Angluin, D. 175 331 Anthony, M. 332 Anti-Unification Algorithm 228 244 Antisymmetric relation 220 Application of ILP xiii 346 354 357 358 Approximately correct 323 Apt, K. ix x 65 106 115 118n 120 133 142 149 150 153—155 159 AQ 354 Arikawa, S. 175 Arimura, H. 225n 337 Aristotle 174 Arithmetical computation 358 Arity 18 artificial intelligence 30 55 164 174 Assistant 355 atom 4 20 219 225 300 Atomic generalization 243 Atomic order 243 Attribute-value learning 175 176 355 Austin, G. 175 Background knowledge xi xii 163 165 279 281 287 290 304 352 Background knowledge in inverse resolution 199 Background knowledge in PAC learning 333 Backtracing Algorithm 176 188 356 357 Backtracing Algorithm, correctness of 190 Bacon, F. 174 Bain, M. 76 354n Banerji, R. 175 354 Basecase query 339 Batch learning 171 354—357 Bayes' theorem 359 Bergadano, F. x 171 197 346 347 357 358 Bezem, M. 106 Bias 171 346 Bias shift 172 Biggs, N. 332 Binary resolvent 293 Binding 59 Blocked goal 142 Blum, L. 193 Blum, M. 193 Blumer, A. 326 Body (of a clause) 106 135 Bol, R. 142 149 Boole, G. 3 Boolos, G. 18 33 56 168 Bostroem, H. 208 210 357 Boswell, R. 355 Bottom element ( 226 Bottom-up approach to ILP xii 170 197 354 355 Bound variable 21 Bratko, I. 154 155 352 353 355 358 Brazdil, P. 176 Bruner, J. 175 Bruynooghe, M. 197 300 316 355 356 Buntine, W. xii 176 197 279n 280 289 291 294 354 Califf, M. 358 Cameron-Jones, R. 300 354 Carnap, R. 174 Center clause 94 Cestnik, B. 355 Chain of refinements 300 Chang, C.L. ix 65 76 77n 90 91 93 94 Chervonenkis, A. 325 Church's Theorem 56 Church, A. 56 Cigol 176 198 354 Clark, K. 106 128 Clark, P. 355 CLAUDIEN 300 356 358 Clausal language ( 36 Clause ix xi 36 59 165 175 Clause as a set of literals 91 246 Clause as atom 244 Clause Set 347 357 Clause, alternative notations 51 Clause, names of variables in 40 Clause, tautology 45 Clause, universally quantified 39 53 Clint x 347 355 Clocksin, W. 154 155 Closed formula 22 28 Closed formula, restriction to 29 Closed recursive clause 338 Closed world assumption (CWA) 127 145 149 CN2 355 Cohen, B. 176 Cohen, W. 334 337 339 340 347 358 Colmerauer, A. 154 Compactness Theorem 33 Compatible clauses 243 312 Complementary pair 45 66 68 Complete (with respect to examples) 166 184 Completed definition of a predicate symbol 148 Completeness 58 Completeness of computed answers 118 122 125 Completeness of linear resolution 98 99 Completeness of negation as finite failure 153 Completeness of SLD-resolution 109 111 Completeness of UDS specialization 216 Completeness of unconstrained resolution 83 84 Completion 145 149 166n Complexity class NP 246n 338 Complexity class P 338 Complexity class PSPACE 338 Complexity class RP 338 Composite formula 4 20 composition 61 Computable 55 114n Computation rule 120 141 Computation rule, first in, first out 119 132 Computation rule, independence of 121 Computed answer 114 141 Concept 179 323 Concept class 323 Condition * 114 139 Confidence parameter 324 326n Confirmatory problem setting 172 Confucius 176 Conjunction 6 15 Connected clause 335 347 Connective 4 18 Connective, informal explanation of 6 Connective, interpretation of 8 Consistent 12 31 Consistent (with respect to examples) 166 184 Constant 18 Constrained atom 335 Constrained clause 335 347 Constrained set of clauses 335 Constraint logic programming 359 Constraint predicate 335 Contingent 12 31 Contradiction 12 31 Conventional atom 226 Cormen, T. 55 326 338n Correct (with respect to examples) 166 184 328n Correct (with respect to examples) in PAC learning 328 Correct answer 114 150 Counterexample 331 Cover xii 205 223 225 Cover, finite chain of 234 Cover-refinement operator 316 Covering 290 Covering approach 354 Crustacean 357 Cut (!) 157 CWA see "Closed World Assumption" CYCLE 257 Cyclical background knowledge 337 Daidoji, M. 358 Data Mining xi 172 177 Dawes, M. 300 De Morgan's laws 14 De Raedt, L. x 172 197 266 300 316 341 347 355 356 359 de Wolf, R. 76 209 243 266 Decidable 56 see Decidable, implication for function-free clauses 270 Decidable, implication for ground clauses 270 Decidable, in polynomial time 342 Decidable, propositional logic 30 56 Decision procedure 56 Decision tree 164 176 354 355 Deduction 76 77 128 283 Deduction Theorem 11 32 Deduction, how to find 88 Deduction, undecidable 88 Definite goal 106 Definite program 111 127 150 166 167 207 319 327n Definite program clause 106 200 289 Definition of a predicate symbol 147 335 Dehaspe, L. 347 358 Denumerable set 168 Depth of a term or clause 267 Derivation 57 66 71 73 76 Determinate clause 335 Dimopoulos, Y. 173 Disagreement set 63 Disjunction 6 15 Doets, K. ix 106 114n 115 133 153n Dolsak, B. 358 Domain 22 24 179 Domain (in PAC learning) 323 Downward cover xii 223 301 Downward cover of atom 232 236 237 240 302 Downward cover of sets under implication 317 Downward cover under implication 278 Downward cover under subsumption 259 Downward cover with background knowledge 281 Downward cover, complete set of 224 Downward cover, finite chain of 236 239 Downward refinement operator xii 205 300 355 356 Downward refinement operator for finite set 310 Downward refinement operator for Horn clauses 304 312 Downward refinement operator, 318 Downward refinement operator, 305 317 349 350 Downward refinement operator, 312 Downward refinement operator, 301 Downward refinement operator, complete 300 Downward refinement operator, ideal 300 Downward refinement operator, ideal, does not exist 304 Downward refinement operator, locally finite 300 Downward refinement operator, proper 300 Duce 176 Duplication of literals 307 Dzeroski, S. x 172 176 300 334 337—339 341 352 353 355 358 359 E-Herbrand interpretation 147 Eder, E. 65 Ehrenfeucht, A. 326 Elementary substitution 233 305 Emde, W. x 356 359 Empty clause ( 36 Empty clause ( 68 Empty substitution 59 Enumerably infinite set 168 Enumeration 168 181 184 Equality Axioms 146 Equality theory 146 EQUIVALENCE 12 31 Equivalence class 220 Equivalence query 331 Equivalence relation 220 Equivalence, connective 7 Equivalent in a quasi-order 221 Error parameter 323 326n Evaluable representation 327 example 165 172 323 Existential quantifier 18 23 Existential quantifier, interpretation of 27 Existential query 339 Explanatory problem setting 168 Expression 59 Extension of a relation 179 Fact of interpretation 180 Factor 70 200 Failure branch 123 Fair SLD-tree 132 Fair SLDNF-tree 141 FALSE 9 29 Falsify 9 29 Feng, C. 176 336n 355 Fermueller, C.G. 248 Ffga program 337 Filp x Finite Downward Cover Chain Algorithm 235 Finitely failed SLD-tree 131 132 153 Finitely failed SLDNF-tree 138 140 First-order language 21 First-order logic xi 3 17 Fitting 328 Flach, P. 172 175n 197 347 Flattening 346 350 360 Flattening Algorithm 351 Flattening, preserves implication 352 363 Flattening, preserves subsumption 352 361 Floundering 134 138 141 142 156 Foil 176 300 354 Forest background knowledge 337 Formula 31 Frazier, M. 334 Free variable 21 Frege, G. 18 Frisch, A. 337 Function symbol 18 34 350 Function-free 265 267 272 289 296 335 346 350 g-subsumption see "Generalized subsumption" Gamberger, D. 353 Garey, M. 246n 326 338n General program 135 see Generality order xii 191 205 219 225 Generalization xi 169 225 299 Generalized subsumption 280 289 290 Generative clause 335 347 Genesereth, M. 90 92 Genetic algorithm 164 Giordana, A. x Glb see "Greatest lower bound" Gold, E.M. 175 194 321 GOLEM 176 286 355 357 358 Goodman, N. 174 Goodnow, J. 175 Gottlob's Lemma 267 Gottlob, G. 248 266 267
Реклама
-complete axiomatization 
-computed answer 
-subsumption 
) 
) 
) 
|
|
О проекте