• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4619887)   Today's Articles (1520)   Subscriber (49404)
For: Kietz JU, Džeroski S. Inductive logic programming and learnability. ACTA ACUST UNITED AC 1994. [DOI: 10.1145/181668.181674] [Citation(s) in RCA: 14] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
Number Cited by Other Article(s)
1
Complexity parameters for first order classes. Mach Learn 2006. [DOI: 10.1007/s10994-006-8261-3] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/24/2022]
2
Function-free Horn clauses are hard to approximate. ACTA ACUST UNITED AC 2005. [DOI: 10.1007/bfb0027323] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register]
3
Horváth T, Turán G. Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172–191. ARTIF INTELL 2001. [DOI: 10.1016/s0004-3702(01)00062-5] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/17/2022]
4
Valiant LG. Robust logics. ARTIF INTELL 2000. [DOI: 10.1016/s0004-3702(00)00002-3] [Citation(s) in RCA: 11] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
5
Gottlob G, Papadimitriou C. On the Complexity of Single-Rule Datalog Queries. LOGIC FOR PROGRAMMING AND AUTOMATED REASONING 1999. [DOI: 10.1007/3-540-48242-3_13] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/03/2023]
6
De Raedt L. Logical settings for concept-learning. ARTIF INTELL 1997. [DOI: 10.1016/s0004-3702(97)00041-6] [Citation(s) in RCA: 80] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
7
Pac-learning non-recursive prolog clauses. ARTIF INTELL 1995. [DOI: 10.1016/0004-3702(94)00034-4] [Citation(s) in RCA: 16] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
8
Dimopoulos Y, Kakas A. Learning non-monotonic logic programs: Learning exceptions. LECTURE NOTES IN COMPUTER SCIENCE 1995. [DOI: 10.1007/3-540-59286-5_53] [Citation(s) in RCA: 14] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/25/2023]
9
First-order jk-clausal theories are PAC-learnable. ARTIF INTELL 1994. [DOI: 10.1016/0004-3702(94)90112-0] [Citation(s) in RCA: 82] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA