• Ji R, Xia J, Xiong Y and Hu Z. (2021). Generalizable synthesis through unification. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-28). Online publication date: 20-Oct-2021.

    https://doi.org/10.1145/3485544

  • Wang B, Baluta T, Kolluri A and Saxena P. SynGuar: guaranteeing generalization in programming by example. Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (677-689).

    https://doi.org/10.1145/3468264.3468621

  • Gromowski M, Siebers M and Schmid U. (2021). A process framework for inducing and explaining Datalog theories. Advances in Data Analysis and Classification. 10.1007/s11634-020-00422-7.

    http://link.springer.com/10.1007/s11634-020-00422-7

  • Veeraraghavan K, Lee D, Wester B, Ouyang J, Chen P, Flinn J and Narayanasamy S. (2012). DoublePlay. ACM Transactions on Computer Systems. 30:1. (1-24). Online publication date: 1-Feb-2012.

    https://doi.org/10.1145/2110356.2110359

  • Alameldeen A, Wagner I, Chishti Z, Wu W, Wilkerson C and Lu S. (2011). Energy-efficient cache design using variable-strength error-correcting codes. ACM SIGARCH Computer Architecture News. 39:3. (461-472). Online publication date: 22-Jun-2011.

    https://doi.org/10.1145/2024723.2000118

  • Ma K, Li X, Chen M and Wang X. (2011). Scalable power control for many-core architectures running multi-threaded applications. ACM SIGARCH Computer Architecture News. 39:3. (449-460). Online publication date: 22-Jun-2011.

    https://doi.org/10.1145/2024723.2000117

  • Udipi A, Muralimanohar N, Balasubramonian R, Davis A and Jouppi N. (2011). Combining memory and a controller with photonics through 3D-stacking to enable scalable and energy-efficient systems. ACM SIGARCH Computer Architecture News. 39:3. (425-436). Online publication date: 22-Jun-2011.

    https://doi.org/10.1145/2024723.2000115

  • Ma S, Enright Jerger N and Wang Z. (2011). DBAR. ACM SIGARCH Computer Architecture News. 39:3. (413-424). Online publication date: 22-Jun-2011.

    https://doi.org/10.1145/2024723.2000113

  • Romm A. (2011). Solution to Exchanges 8.2 puzzle. ACM SIGecom Exchanges. 10:1. (40-44). Online publication date: 1-Mar-2011.

    https://doi.org/10.1145/1978721.1978732

  • Wright J, Jiang A and Leyton-Brown K. (2011). Linear solvers for nonlinear games. ACM SIGecom Exchanges. 10:1. (9-12). Online publication date: 1-Mar-2011.

    https://doi.org/10.1145/1978721.1978724

  • Jiang A and Leyton-Brown K. (2011). Polynomial computation of exact correlated equilibrium in compact games. ACM SIGecom Exchanges. 10:1. (6-8). Online publication date: 1-Mar-2011.

    https://doi.org/10.1145/1978721.1978723

  • Echenique F, Golovin D and Wierman A. (2011). Complexity and economics. ACM SIGecom Exchanges. 10:1. (2-5). Online publication date: 1-Mar-2011.

    https://doi.org/10.1145/1978721.1978722

  • Müller M. Modalities, Relations, and Learning. Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science. (260-275).

    https://doi.org/10.1007/978-3-642-04639-1_18

  • Rullo P, Policicchio V, Cumbo C and Iiritano S. (2009). Olex. IEEE Transactions on Knowledge and Data Engineering. 21:8. (1118-1132). Online publication date: 1-Aug-2009.

    https://doi.org/10.1109/TKDE.2008.206

  • Joshi S, Ramakrishnan G and Srinivasan A. Feature Construction Using Theory-Guided Sampling and Randomised Search. Proceedings of the 18th international conference on Inductive Logic Programming. (140-157).

    https://doi.org/10.1007/978-3-540-85928-4_14

  • Arias M and Khardon R. (2006). Complexity parameters for first order classes. Machine Language. 64:1-3. (121-144). Online publication date: 1-Sep-2006.

    https://doi.org/10.1007/s10994-006-8261-3

  • Kuwabara M, Ogawa T, Hirata K and Harao M. On generalization and subsumption for ordered clauses. Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence. (212-223).

    https://doi.org/10.1007/11780496_24

  • Hirata K. (2005). Prediction-hardness of acyclic conjunctive queries. Theoretical Computer Science. 348:1. (84-94). Online publication date: 2-Dec-2005.

    https://doi.org/10.1016/j.tcs.2005.09.006

  • Ng K. Generalization behaviour of alkemic decision trees. Proceedings of the 15th international conference on Inductive Logic Programming. (246-263).

    https://doi.org/10.1007/11536314_15

  • Džeroski S. Relational Data Mining. Data Mining and Knowledge Discovery Handbook. 10.1007/0-387-25465-X_41. (869-898).

    http://link.springer.com/10.1007/0-387-25465-X_41

  • Rao M. Learnability of simply-moded logic programs from entailment. Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday. (128-141).

    https://doi.org/10.1007/978-3-540-30502-6_9

  • Ben-Eliyahu-Zohary R, Gudes E and Ianni G. (2003). Metaqueries. Artificial Intelligence. 149:1. (61-87). Online publication date: 1-Sep-2003.

    https://doi.org/10.1016/S0004-3702(03)00073-0

  • Džeroski S. (2003). Multi-relational data mining. ACM SIGKDD Explorations Newsletter. 5:1. (1-16). Online publication date: 1-Jul-2003.

    https://doi.org/10.1145/959242.959245

  • Nock R. (2003). Complexity in the case against accuracy estimation. Theoretical Computer Science. 10.1016/S0304-3975(02)00573-X. 301:1-3. (143-165). Online publication date: 1-May-2003.

    https://linkinghub.elsevier.com/retrieve/pii/S030439750200573X

  • Stearns R. (2003). Deterministic versus nondeterministic time and lower bound problems. Journal of the ACM. 50:1. (91-95). Online publication date: 1-Jan-2003.

    https://doi.org/10.1145/602382.602409

  • Cumby C and Roth D. (2003). Learning with Feature Description Logics. Inductive Logic Programming. 10.1007/3-540-36468-4_3. (32-47).

    http://link.springer.com/10.1007/3-540-36468-4_3

  • Kim C, Burger D and Keckler S. (2002). An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches. ACM SIGPLAN Notices. 37:10. (211-222). Online publication date: 1-Oct-2002.

    https://doi.org/10.1145/605432.605420

  • Oplinger J and Lam M. (2002). Enhancing software reliability with speculative threads. ACM SIGPLAN Notices. 37:10. (184-196). Online publication date: 1-Oct-2002.

    https://doi.org/10.1145/605432.605417

  • Ashok R, Chheda S and Moritz C. (2002). Cool-Mem. ACM SIGPLAN Notices. 37:10. (133-143). Online publication date: 1-Oct-2002.

    https://doi.org/10.1145/605432.605412

  • Levis P and Culler D. (2002). Maté. ACM SIGPLAN Notices. 37:10. (85-95). Online publication date: 1-Oct-2002.

    https://doi.org/10.1145/605432.605407

  • Ogata K, Komatsu H and Nakatani T. (2002). Bytecode fetch optimization for a Java interpreter. ACM SIGPLAN Notices. 37:10. (58-67). Online publication date: 1-Oct-2002.

    https://doi.org/10.1145/605432.605404

  • Korhonen A, Malmi L, Myllyselkä P and Scheinin P. (2002). Does it make a difference if students exercise on the web or in the classroom?. ACM SIGCSE Bulletin. 34:3. (121-124). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544452

  • Schreiner W. (2002). A java toolkit for teaching distributed algorithms. ACM SIGCSE Bulletin. 34:3. (111-115). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544449

  • Carr S, Chen P, Jozwowski T, Mayo J and Shene C. (2002). Channels, visualization, and topology editor. ACM SIGCSE Bulletin. 34:3. (106-110). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544448

  • Yehezkel C. (2002). A taxonomy of computer architecture visualizations. ACM SIGCSE Bulletin. 34:3. (101-105). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544447

  • Levy D and Lapidot T. (2002). Shared terminology, private syntax. ACM SIGCSE Bulletin. 34:3. (89-93). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544442

  • Haberman B and Averbuch H. (2002). The case of base cases. ACM SIGCSE Bulletin. 34:3. (84-88). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544441

  • Hamer J. (2002). Hashing revisited. ACM SIGCSE Bulletin. 34:3. (80-83). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544440

  • Christensen H and Caspersen M. (2002). Frameworks in CS1. ACM SIGCSE Bulletin. 34:3. (75-79). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544438

  • Alphonce C and Ventura P. (2002). Object orientation in CS1-CS2 by design. ACM SIGCSE Bulletin. 34:3. (70-74). Online publication date: 1-Sep-2002.

    https://doi.org/10.1145/637610.544437

  • Cumby C and Roth D. Learning with feature description logics. Proceedings of the 12th international conference on Inductive logic programming. (32-47).

    /doi/10.5555/1765335.1765339

  • Jain S and Sharma A. (2002). Mind change complexity of learning logic programs. Theoretical Computer Science. 284:1. (143-160). Online publication date: 6-Jul-2002.

    https://doi.org/10.1016/S0304-3975(01)00084-6

  • Lawson B and Smirni E. (2002). Multiple-queue backfilling scheduling with priorities and reservations for parallel systems. ACM SIGMETRICS Performance Evaluation Review. 29:4. (40-47). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/512840.512846

  • Cheng W, Chou C, Golubchik L and Khuller S. (2002). A performance study of Bistro, a scalable upload architecture. ACM SIGMETRICS Performance Evaluation Review. 29:4. (31-39). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/512840.512845

  • Sevcik K and Wang H. (2002). Solution properties and convergence of an approximate mean value analysis algorithm. ACM SIGMETRICS Performance Evaluation Review. 29:4. (3-10). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/512840.512842

  • Anderson R. (2002). Coming together to explore the intersections of HCI, experience design, and information architecture. Interactions. 9:2. (109-111). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/505103.505137

  • Marcus A. (2002). Metaphors and user interfaces in the 21st Century. Interactions. 9:2. (7-10). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/505103.505107

  • Rao M and Sattar A. (2001). Polynomial-time learnability of logic programs with local variables from entailment. Theoretical Computer Science. 268:2. (179-198). Online publication date: 17-Oct-2001.

    https://doi.org/10.1016/S0304-3975(00)00270-X

  • An introduction to inductive logic programming. Relational Data Mining. (48-71).

    /doi/10.5555/567222.567226

  • Carlucci Aiello L and Massacci F. (2001). Verifying security protocols as planning in logic programming. ACM Transactions on Computational Logic. 2:4. (542-580). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/383779.383785

  • De Giacomo G, Levesque H and Sardiña S. (2001). Incremental execution of guarded theories. ACM Transactions on Computational Logic. 2:4. (495-525). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/383779.383782

  • Lavrač N and Flach P. (2001). An extended transformation approach to inductive logic programming. ACM Transactions on Computational Logic. 2:4. (458-494). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/383779.383781

  • Papadias D, Mamoulis N and Delis V. (2001). Approximate spatio-temporal retrieval. ACM Transactions on Information Systems. 19:1. (53-96). Online publication date: 1-Jan-2001.

    https://doi.org/10.1145/366836.366874

  • de Oliveira M, Turine M and Masiero P. (2001). A statechart-based model for hypermedia applications. ACM Transactions on Information Systems. 19:1. (28-52). Online publication date: 1-Jan-2001.

    https://doi.org/10.1145/366836.366869

  • Džeroski S and Lavrač N. (2001). An Introduction to Inductive Logic Programming. Relational Data Mining. 10.1007/978-3-662-04599-2_3. (48-73).

    http://link.springer.com/10.1007/978-3-662-04599-2_3

  • Gharachorloo K, Sharma M, Steely S and Van Doren S. (2000). Architecture and design of AlphaServer GS320. ACM SIGOPS Operating Systems Review. 34:5. (13-24). Online publication date: 1-Dec-2000.

    https://doi.org/10.1145/384264.378997

  • Giordana A and Saitta L. (2000). Phase Transitions in Relational Learning. Machine Language. 41:2. (217-251). Online publication date: 1-Nov-2000.

    https://doi.org/10.1023/A:1007620705405

  • Krishna Rao M. (2000). Some classes of Prolog programs inferable from positive data. Theoretical Computer Science. 241:1-2. (211-234). Online publication date: 28-Jun-2000.

    https://doi.org/10.1016/S0304-3975(99)00271-6

  • (2000). 10.1162/153244304773936018. CrossRef Listing of Deleted DOIs. 10.1162/153244304773936018. 1.

    http://www.crossref.org/deleted_DOI.html

  • Masand B and Spiliopoulou M. (2000). WEBKDD'99. ACM SIGKDD Explorations Newsletter. 1:2. (108-111). Online publication date: 1-Jan-2000.

    https://doi.org/10.1145/846183.846209

  • Goodman A. (2000). Interface '99. ACM SIGKDD Explorations Newsletter. 1:2. (97-104). Online publication date: 1-Jan-2000.

    https://doi.org/10.1145/846183.846207

  • Kohavi R, Sahami M, Belcher S, Bozik J, Gerritsen R, Ono K and Pyle D. (2000). KDD-99 panel report. ACM SIGKDD Explorations Newsletter. 1:2. (55-58). Online publication date: 1-Jan-2000.

    https://doi.org/10.1145/846183.846196

  • Reid M and Ryan M. (2000). Using ILP to Improve Planning in Hierarchical Reinforcement Learning. Inductive Logic Programming. 10.1007/3-540-44960-4_11. (174-190).

    http://link.springer.com/10.1007/3-540-44960-4_11

  • Hirata K. (2000). On the Hardness of Learning Acyclic Conjunctive Queries. Algorithmic Learning Theory. 10.1007/3-540-40992-0_18. (238-251).

    http://link.springer.com/10.1007/3-540-40992-0_18

  • Khardon R. (1999). Learning Function-Free Horn Expressions. Machine Language. 37:3. (241-275). Online publication date: 1-Dec-1999.

    https://doi.org/10.1023/A:1007610422992

  • Khardon R, Roth D and Valiant L. Relational learning for NLP using linear threshold elements. Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2. (911-917).

    /doi/10.5555/1624312.1624349

  • Khardon R. (1999). Learning to Take Actions. Machine Language. 35:1. (57-90). Online publication date: 1-Apr-1999.

    https://doi.org/10.1023/A:1007571119753

  • Blockeel H, De Raedt L, Jacobs N and Demoen B. (1999). Scaling Up Inductive Logic Programming by Learning from Interpretations. Data Mining and Knowledge Discovery. 3:1. (59-93). Online publication date: 1-Mar-1999.

    https://doi.org/10.1023/A:1009867806624

  • Reddy C and Tadepalli P. (1999). Learning Horn definitions: Theory and an application to planning. New Generation Computing. 17:1. (77-98). Online publication date: 1-Mar-1999.

    https://doi.org/10.1007/BF03037583

  • Jain S and Sharma A. (1999). Mind Change Complexity of Learning Logic Programs. Computational Learning Theory. 10.1007/3-540-49097-3_16. (198-213).

    http://link.springer.com/10.1007/3-540-49097-3_16

  • Martin E and Sharma A. (1999). On Sufficient Conditions for Learnability of Logic Programs from Positive Data. Inductive Logic Programming. 10.1007/3-540-48751-4_19. (198-209).

    http://link.springer.com/10.1007/3-540-48751-4_19

  • Tsapara I and Turán G. Learning atomic formulas with prescribed properties. Proceedings of the eleventh annual conference on Computational learning theory. (166-174).

    https://doi.org/10.1145/279943.279978

  • Khardon R. Learning first order universal Horn expressions. Proceedings of the eleventh annual conference on Computational learning theory. (154-165).

    https://doi.org/10.1145/279943.279976

  • Cohen W. (1998). Hardness Results for Learning First-Order Representations and Programming by Demonstration. Machine Language. 30:1. (57-87). Online publication date: 1-Jan-1998.

    https://doi.org/10.1023/A:1007406511732

  • Krishna Rao M and Sattar A. (1998). Learning linearly-moded programs from entailment. PRICAI’98: Topics in Artificial Intelligence. 10.1007/BFb0095294. (482-493).

    http://link.springer.com/10.1007/BFb0095294

  • Jappy P and Nock R. (1998). PAC learning conceptual graphs. Conceptual Structures: Theory, Tools and Applications. 10.1007/BFb0054923. (303-315).

    http://link.springer.com/10.1007/BFb0054923

  • Zucker J and Ganascia J. (1998). Learning structurally indeterminate clauses. Inductive Logic Programming. 10.1007/BFb0027327. (235-244).

    http://link.springer.com/10.1007/BFb0027327

  • Nock R and Jappy P. (1998). Function-free Horn clauses are hard to approximate. Inductive Logic Programming. 10.1007/BFb0027323. (195-204).

    http://link.springer.com/10.1007/BFb0027323

  • Reddy C and Tadepalli P. (1998). Learning first-order acyclic Horn programs from entailment. Inductive Logic Programming. 10.1007/BFb0027308. (23-37).

    http://link.springer.com/10.1007/BFb0027308

  • McCreath E and Sharma A. (1998). Lime: A System for Learning Relations. Algorithmic Learning Theory. 10.1007/3-540-49730-7_25. (336-374).

    http://link.springer.com/10.1007/3-540-49730-7_25

  • Wrobel S. (1998). Scalability Issues in Inductive Logic Programming. Algorithmic Learning Theory. 10.1007/3-540-49730-7_2. (11-30).

    http://link.springer.com/10.1007/3-540-49730-7_2

  • Krishna Rao M and Sattar A. (1998). Learning from Entailment of Logic Programs with Local Variables. Algorithmic Learning Theory. 10.1007/3-540-49730-7_11. (143-157).

    http://link.springer.com/10.1007/3-540-49730-7_11

  • Horváth T, Sloan R and Turán G. Learning logic programs by using the product homomorphism method. Proceedings of the tenth annual conference on Computational learning theory. (10-20).

    https://doi.org/10.1145/267460.267468

  • Torre F and Rouveirol C. Natural ideal operators in Inductive Logic Programming. Proceedings of the 9th European Conference on Machine Learning. (274-289).

    https://doi.org/10.1007/3-540-62858-4_92

  • Horváth T, Sloan R and Turán G. (1997). Learning Logic programs with random classification noise. Inductive Logic Programming. 10.1007/3-540-63494-0_63. (315-336).

    http://link.springer.com/10.1007/3-540-63494-0_63

  • Scheffer T, Herbrich R and Wysotzki F. (1997). Efficient θ-subsumption based on graph algorithms. Inductive Logic Programming. 10.1007/3-540-63494-0_57. (212-228).

    http://link.springer.com/10.1007/3-540-63494-0_57

  • Cohen W. Learning trees and rules with set-valued features. Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1. (709-716).

    /doi/10.5555/1892875.1892981

  • Wrobel S, Wettschereck D, Sommer E and Emde W. Extensibility in data mining systems. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. (214-219).

    /doi/10.5555/3001460.3001504

  • Lavrač N and Džeroski S. (1996). A reply to Pazzani's book review of “Inductive Logic Programming: Techniques and Applications”. Machine Learning. 10.1007/BF00116902. 23:1. (109-111). Online publication date: 1-Apr-1996.

    http://link.springer.com/10.1007/BF00116902

  • Cohen W. The dual DFA learning problem (extended abstract). Proceedings of the ninth annual conference on Computational learning theory. (29-40).

    https://doi.org/10.1145/238061.238066

  • Raedt L. (1996). PAC-learning logic programs under the closed-world assumption. Foundations of Intelligent Systems. 10.1007/3-540-61286-6_177. (531-540).

    http://link.springer.com/10.1007/3-540-61286-6_177

  • Cohen W and Page C. (1995). Polynomial learnability and Inductive Logic Programming: Methods and results. New Generation Computing. 10.1007/BF03037231. 13:3-4. (369-409). Online publication date: 1-Dec-1995.

    http://link.springer.com/10.1007/BF03037231

  • Lauth B. (1995). Inductive inference in the limit of empirically adequate theories. Journal of Philosophical Logic. 10.1007/BF01052601. 24:5. (525-548). Online publication date: 1-Oct-1995.

    http://link.springer.com/10.1007/BF01052601

  • Stahl I. (1995). The Appropriateness of Predicate Invention as Bias Shift Operation in ILP. Machine Language. 20:1-2. (95-117). Online publication date: 1-Jul-1995.

    https://doi.org/10.1007/BF00993476

  • Džeroski S, Todorovski L and Urbančič T. Handling real numbers in ILP. Proceedings of the 8th European Conference on Machine Learning. (283-286).

    https://doi.org/10.1007/3-540-59286-5_68

  • Lavrač N and De Raedt L. (1995). Inductive Logic Programming. AI Communications. 8:1. (3-19). Online publication date: 1-Jan-1995.

    /doi/10.5555/2637330.2637331

  • Rao M. (1995). Incremental learning of logic programs. Algorithmic Learning Theory. 10.1007/3-540-60454-5_31. (95-109).

    http://link.springer.com/10.1007/3-540-60454-5_31

  • Cohen W. Pac-learning nondeterminate clauses. Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence. (676-681).

    /doi/10.5555/2891730.2891834

  • Laer W, Dehaspe L and Raedt L. Applications of a logical discovery engine. Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. (263-274).

    /doi/10.5555/3000850.3000877

  • Muggleton S. Bayesian inductive logic programming. Proceedings of the seventh annual conference on Computational learning theory. (3-11).

    https://doi.org/10.1145/180139.178095

  • Frazier M and Pitt L. CLASSIC learning. Proceedings of the seventh annual conference on Computational learning theory. (23-34).

    https://doi.org/10.1145/180139.174994

  • Kietz J and Džeroski S. (1994). Inductive logic programming and learnability. ACM SIGART Bulletin. 5:1. (22-32). Online publication date: 1-Jan-1994.

    https://doi.org/10.1145/181668.181674

  • Muggleton S. (1994). Inductive logic programming. ACM SIGART Bulletin. 5:1. (5-11). Online publication date: 1-Jan-1994.

    https://doi.org/10.1145/181668.181671

  • LAVRAČ N and DŽEROSKI S. (1994). Weakening the language bias in LINUS. Journal of Experimental & Theoretical Artificial Intelligence. 10.1080/09528139408953783. 6:1. (95-119). Online publication date: 1-Jan-1994.

    http://www.tandfonline.com/doi/abs/10.1080/09528139408953783

  • Muggleton S. (1994). Bayesian Inductive Logic Programming. Machine Learning Proceedings 1994. 10.1016/B978-1-55860-335-6.50052-0. (371-379).

    https://linkinghub.elsevier.com/retrieve/pii/B9781558603356500520

  • Rouveirol C and Albert P. (1994). Knowledge level model of a configurable learning system. A Future for Knowledge Acquisition. 10.1007/3-540-58487-0_20. (374-393).

    http://link.springer.com/10.1007/3-540-58487-0_20

  • Džeroski S and Todorovski L. Discovering dynamics. Proceedings of the 2nd International Conference on Knowledge Discovery in Databases. (125-137).

    /doi/10.5555/3000767.3000781

  • Frazier M and Page C. Learnability in inductive logic programming. Proceedings of the eleventh national conference on Artificial intelligence. (93-98).

    /doi/10.5555/1867270.1867285

  • Cohen W. Pac-learning a restricted class of recursive logic programs. Proceedings of the eleventh national conference on Artificial intelligence. (86-92).

    /doi/10.5555/1867270.1867284

  • Cohen W. Cryptographic limitations on learning one-clause logic programs. Proceedings of the eleventh national conference on Artificial intelligence. (80-85).

    /doi/10.5555/1867270.1867283

  • Ghosh K, Fujimoto R and Schwan K. (1993). Time Warp simulation in time constrained systems. ACM SIGSIM Simulation Digest. 23:1. (163-166). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158481

  • Mehl H and Hammes S. (1993). Shared variables in distributed simulation. ACM SIGSIM Simulation Digest. 23:1. (68-75). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158468

  • Lubachevsky B. (1993). Several unsolved problems in large-scale discrete event simulations. ACM SIGSIM Simulation Digest. 23:1. (60-67). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158467

  • Nandy B and Loucks W. (1993). On a parallel partitioning technique for use with conservative parallel simulation. ACM SIGSIM Simulation Digest. 23:1. (43-51). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158465

  • Nicol D. (1993). Global synchronization for optimistic parallel discrete event simulation. ACM SIGSIM Simulation Digest. 23:1. (27-34). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158463

  • Nicol D and Heidelberger P. (1993). Parallel algorithms for simulating continuous time Markov chains. ACM SIGSIM Simulation Digest. 23:1. (11-18). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158461

  • Lin Y, Preiss B, Loucks W and Lazowska E. (1993). Selecting the checkpoint interval in time warp simulation. ACM SIGSIM Simulation Digest. 23:1. (3-10). Online publication date: 1-Jul-1993.

    https://doi.org/10.1145/174134.158460

  • Kietz J. Some lower bounds for the computational complexity of inductive logic programming. Proceedings of the 6th European Conference on Machine Learning. (115-123).

    https://doi.org/10.1007/3-540-56602-3_131

  • Džeroski S and Todorovski L. (1993). Discovering Dynamics. Machine Learning Proceedings 1993. 10.1016/B978-1-55860-307-3.50019-8. (97-103).

    https://linkinghub.elsevier.com/retrieve/pii/B9781558603073500198

  • Yamamoto A. (1993). Generalized unification as background knowledge in learning logic programs. Algorithmic Learning Theory. 10.1007/3-540-57370-4_41. (111-122).

    http://link.springer.com/10.1007/3-540-57370-4_41

  • Lavrač N and Džeroski S. (1992). Background knowledge and declarative bias in inductive concept learning. Analogical and Inductive Inference. 10.1007/3-540-56004-1_4. (51-71).

    http://link.springer.com/10.1007/3-540-56004-1_4

  • Martin C and Martin D. (1990). Professional codes of conduct and computer ethics education. ACM SIGSAC Review. 8:3. (1-12). Online publication date: 1-Sep-1990.

    https://doi.org/10.1145/382101.382103

  • Lengauer T. (1989). Hierarchical planarity testing algorithms. Journal of the ACM. 36:3. (474-509). Online publication date: 1-Jul-1989.

    https://doi.org/10.1145/65950.65952

  • Crowcroft J and Paliwoda K. (1988). A multicast transport protocol. ACM SIGCOMM Computer Communication Review. 18:4. (247-256). Online publication date: 1-Aug-1988.

    https://doi.org/10.1145/52325.52349

  • Seo K, Crowcroft J, Spilling P, Laws J and Leddy J. (1988). Distributed testing and measurement across the Atlantic packet satellite network(SATNET). ACM SIGCOMM Computer Communication Review. 18:4. (235-246). Online publication date: 1-Aug-1988.

    https://doi.org/10.1145/52325.52348

  • Motro A. (1986). BAROQUE: a browser for relational databases. ACM Transactions on Information Systems. 4:2. (164-181). Online publication date: 1-Apr-1986.

    https://doi.org/10.1145/6168.6172

  • Hudson S and King R. (1986). A generator of direct manipulation office systems. ACM Transactions on Information Systems. 4:2. (132-163). Online publication date: 1-Apr-1986.

    https://doi.org/10.1145/6168.6171

  • Francez N and Yemini S. (1985). Symmetric intertask communication. ACM Transactions on Programming Languages and Systems. 7:4. (622-636). Online publication date: 1-Oct-1985.

    https://doi.org/10.1145/4472.4475

  • Boehm H. (1985). Side effects and aliasing can have simple axiomatic descriptions. ACM Transactions on Programming Languages and Systems. 7:4. (637-655). Online publication date: 1-Oct-1985.

    https://doi.org/10.1145/4472.4474