Foundations of Inductive Logic ProgrammingSpringer Science & Business Media, 18 квіт. 1997 р. - 404 стор. 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. |
Зміст
III | 3 |
V | 4 |
VI | 5 |
VIII | 7 |
IX | 9 |
X | 15 |
XII | 17 |
XIII | 18 |
XCIV | 203 |
XCV | 205 |
XCVII | 207 |
XCVIII | 209 |
XCIX | 213 |
C | 217 |
CI | 219 |
CII | 220 |
XIV | 22 |
XV | 24 |
XVI | 29 |
XVII | 33 |
XVIII | 34 |
XIX | 35 |
XX | 36 |
XXI | 39 |
XXIII | 40 |
XXIV | 45 |
XXV | 48 |
XXVI | 50 |
XXVII | 51 |
XXVIII | 55 |
XXIX | 57 |
XXX | 59 |
XXXII | 63 |
XXXIII | 65 |
XXXIV | 68 |
XXXV | 73 |
XXXVI | 75 |
XXXVII | 77 |
XXXVIII | 78 |
XL | 79 |
XLI | 82 |
XLII | 84 |
XLIII | 87 |
XLV | 90 |
XLVI | 91 |
XLVII | 93 |
XLVIII | 94 |
XLIX | 95 |
L | 98 |
LI | 100 |
LII | 103 |
LIII | 105 |
LIV | 106 |
LV | 108 |
LVII | 109 |
LVIII | 111 |
LIX | 113 |
LX | 119 |
LXI | 122 |
LXII | 125 |
LXIII | 126 |
LXIV | 127 |
LXV | 130 |
LXVI | 133 |
LXVII | 141 |
LXVIII | 145 |
LXIX | 150 |
LXX | 153 |
LXXI | 154 |
LXXIII | 155 |
LXXIV | 157 |
LXXV | 159 |
LXXVI | 161 |
LXXVII | 163 |
LXXVIII | 165 |
LXXIX | 172 |
LXXX | 173 |
LXXXI | 174 |
LXXXII | 177 |
LXXXIII | 179 |
LXXXIV | 180 |
LXXXVI | 182 |
LXXXVII | 184 |
LXXXVIII | 186 |
LXXXIX | 191 |
XC | 192 |
XCI | 195 |
XCII | 197 |
XCIII | 198 |
CIII | 225 |
CV | 227 |
CVII | 232 |
CIX | 234 |
CXI | 237 |
CXII | 240 |
CXIII | 241 |
CXIV | 243 |
CXV | 245 |
CXVI | 247 |
CXVII | 249 |
CXVIII | 251 |
CXIX | 252 |
CXX | 256 |
CXXII | 257 |
CXXIII | 260 |
CXXV | 261 |
CXXVI | 262 |
CXXVII | 265 |
CXXVIII | 266 |
CXXIX | 267 |
CXXX | 274 |
CXXXI | 275 |
CXXXII | 277 |
CXXXIII | 278 |
CXXXIV | 279 |
CXXXV | 281 |
CXXXVII | 285 |
CXXXVIII | 287 |
CXL | 288 |
CXLI | 289 |
CXLIII | 294 |
CXLIV | 297 |
CXLV | 299 |
CXLVI | 300 |
CXLVII | 303 |
CXLVIII | 305 |
CL | 306 |
CLI | 310 |
CLII | 311 |
CLIII | 315 |
CLIV | 316 |
CLV | 317 |
CLVI | 319 |
CLVII | 321 |
CLIX | 322 |
CLX | 324 |
CLXI | 326 |
CLXIII | 328 |
CLXIV | 329 |
CLXVI | 330 |
CLXVIII | 331 |
CLXIX | 332 |
CLXX | 333 |
CLXXI | 335 |
CLXXII | 338 |
CLXXIII | 340 |
CLXXIV | 341 |
CLXXV | 342 |
CLXXVI | 345 |
CLXXVII | 346 |
CLXXVIII | 347 |
CLXXIX | 350 |
CLXXX | 352 |
CLXXXI | 354 |
CLXXXII | 358 |
CLXXXIII | 359 |
CLXXXIV | 360 |
CLXXXV | 365 |
CLXXXVI | 369 |
391 | |
395 | |
Інші видання - Показати все
Foundations of Inductive Logic Programming Shan-Hwei Nienhuys-Cheng,Ronald de Wolf Попередній перегляд недоступний - 2014 |
Загальні терміни та фрази
algorithm arity Artificial Intelligence background knowledge binary resolvent C₁ C1 and C2 C₂ chapter clausal language comp(II computation rule computed answer concept class conjunctive normal form construct contains D₁ deduction defined definite program clauses denote derivation distinct variables domain downward covers equivalent exists false finite complete set finite number finite set finitely failed first-order logic function symbol ground atoms ground instances Hence Herbrand interpretation Horn clauses IIU G implies inductive logic programming input clause Lemma Machine Learning model inference negative literals normal program occurs PAC learnable polynomial time PAC positive examples predicate symbol prenex conjunctive normal Proof propositional logic prove quasi-order R₁ refutation completeness set of clauses set of downward set of ground SLD-derivation SLD-refutation SLD-resolution SLD-tree SLDNF-tree standard form subset subsidiary tree subsumes Subsumption Theorem Suppose tautology true truth value unified universally quantified upward covers variants
Посилання на книгу
Inductive Logic Programming: 9th International Workshop, ILP-99, Bled ... Sašo Džeroski,Peter A. Flach Попередній перегляд недоступний - 1999 |
Abduction and Induction: Essays on Their Relation and Integration P.A. Flach,Antonis C. Kakas Обмежений попередній перегляд - 2000 |