Learning logic programs with structured background knowledge

Artificial Intelligence

Volumn 128, Issue 1-2, 2001, Pages 31-97

  Horváth, Tamás ^a   Turán, György ^b,c  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Computational learning theory; Concept learning; Inductive logic programming; PAC learning; VC dimension

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MORPHOLOGY; POLYNOMIALS;

NONRECURSIVE HORN CLAUSES; PRODUCT HOMOMORPHISM METHOD;

ARTIFICIAL INTELLIGENCE;

EID: 0035339464     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00062-5     Document Type: Article

References (66)

1. Learning acyclic first-order Horn sentences from entailment
2. Learnability and the Vapnik-Chervonenkis dimension
3. Generalized subsumption and its application to induction and redundancy
4. PAC-learning non-recursive Prolog clauses
5. PAC-learning recursive logic programs: Efficient algorithms
6. PAC-learning recursive logic programs: Negative results
7. The learnability of description logics with equality constraints
8. Polynomial learnability and inductive logic programming: Methods and results
9. Complexity and expressive power of logic programming
10. Logical settings for concept-learning
11. First order jk-clausal theories are PAC-learnable
12. PAC-learnability of determinate logic programs
13. Finite Model Theory
14. Learning from entailment: An application to propositional Horn sentences
15. CLASSIC learning
16. Subsumption and implication
17. Polynomial graph-colorings
18. On multiplicative graphs and the product conjecture
19. Learning conjunctive concepts in structural domains
20. Equivalence of models for polynomial learnability
21. Homomorphisms to oriented paths
22. Application of different learning methods to Hungarian part-of-speech tagging
23. Learning logic programs by using the product homomorphism method
24. Learning logic programs with random classification noise
25. Learning logic programs with structured background knowledge
26. Efficient noise-tolerant learning from statistical queries
27. Learning function-free Horn expressions
28. Some lower bounds for the computational complexity of inductive logic programming
29. Inductive logic programming and learnability
30. The Art of Computer Programming
31. Learning simple concept under simple distributions
32. On learnability and predicate logic
33. Inductive logic programming
34. Inductive logic programming: Theory and methods
35. Efficient induction in logic programs
36. On learning boolean functions
37. Probably approximate learning of sets and functions
38. On classes of relations and graphs determined by subobjects and factorobjetcs
39. Foundations of Inductive Logic Programming
40. Generalization and learnability: A study of constrained atoms
41. Computational limitations on learning from examples
42. A note on inductive generalization
43. A further note on inductive generalization
44. Learning from examples and membership queries with structured determinations
45. Learning atomic formulas with prescribed properties
46. A theory of the learnable
47. Robust logics
48. Multiplicativity, Part I. Variations, multiplicative graphs and digraphs
49. Multiplicativity, Part II. Nonmultiplicative digraphs and characterization of oriented paths
50. Unification revisited