Efficient θ-subsumption based on graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1314, Issue , 1997, Pages 212-228

  Scheffer, Tobias ^a   Herbrich, Ralf ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LEARNING SYSTEMS;

CLIQUE ALGORITHM; FIXED SIZE; GRAPH ALGORITHMS; LITERALS; MESH DESIGNS; PRUNING STRATEGY; SEARCH SPACES;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 77954396828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63494-0_57     Document Type: Conference Paper

References (28)

1. B. Dolsak and S. Muggleton. The application of inductive logic programming to finite-element mesh design. In Inductive Logic Programming, London, 1992. Academic Press.
2. R. Carraghan and P. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9:375-382, 1990.
3. L. DeRaedt and M. Bruynooghe. A theory of clausal discovery. In Proc, Workshop on ILP, 1993.
4. S. Dzeroski, S. Muggleton, and S. Russel. Pac-learnability of determinate logic programs. In Proc. 5th ACM Workshop on Computational Learning Theory, pages 128-135, 1992.
5. N. Eisinger. Subsumption and connection graphs. In Proc. IJCAI, 1981.
6. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating the maxclique is almost NP-complete. In Proc. 32nd IEEE Symp. on Foundations of Comp. Sci., 1991.
7. L. Gibbons, D. Hearn, and P. Pardalos. A continuous based heuristic for the maximum clique problem. In Clique, Graph Coloring and Satisfiability: Second DIM ACS Implementation Challenge, 1996.
8. G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. J. ACM, 32(2):280-295, 1985.
9. G. Gottlob. Subsumption and implication. Information Processing Letters, 24:109-111, 1987.
10. P. Geibel and F. Wysotzki. Learning relational concepts with decision trees. In Proc. ICML, 1996.
11. P. Geibel and F. Wysotzki. Relational learning with decision trees. In Proc. ECAI, 1996.
12. D. S. Johnson and M. A. Trick, editors. Clique, Graph Coloring and Satisfiability: Second DIM ACS Implementation Challenge, DIMACS series, 1996.
13. B. M. Kim and J. W. Cho. A new subsumption method in the connection graph proof procedure. Theoretical Computer Science, 103:283-309, 1992.
14. J.-U. Kietz and M. Liibbe. An efficient subsumption algorithm for inductive logic programming. In Proc. International Conference on Machine Learning, 1994.
15. D. Kapur and P. Narendran. NP-completeness of the set unification and matching problems. In Proc. 8th International Conference on Automated Deduction, 1986.
16. R. Kowalski. A proof procedure using connection graphs. J. ACM, 22(4):572-595, 1975.
17. D. W. Loveland. Automated theorem proving: A logical basis. Elsevier, North Holland, 1978.
18. S. Muggleton and C. Feng. Efficient induction of logic programs. In Proc. 1st Conf. on Algorithmic Learning Theory, pages 368-381, 1990.
19. S. Muggleton. Inverting implication. Artificial Intelligence Journal, 1993.
20. G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, pages 153-163, 1970.
21. J. A. Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23-41, 1965.
22. Sharon Sickel. A search technique for clause interconnectivity graphs. IEEE Transactions on Computers, C-25(8):823-835, 1976.
23. R. Socher. A subsumption algorithm based on characteristic matrices. In Proc. 9th Int. Conf. on Automated Deduction, 1988.
24. G. Tinhofer. Zum algorithmischen Nachweis der Isomorphic von endlichen Graphen. In H. Noltemeier, editor, Graphen, Algorithmen, Datenstruk- turen. 2. Fachtagung after Graphentheoretische Konzepte der Informatik. Carl Hanser Verlag, 1976.
25. S. Unger and F. Wysotzki. Lernfahige Klassifizierungssysteme. Akademie Verlag Berlin, 1981.
26. P. van der Laag and S. Nienhuys-Cheng. Subsumption and refinement in model inference. In Machine Learning: ECML, 1993.
27. B. Weisfeiler. On Construction and Identification of Graphs. Number 558 in Lecture Notes in Mathematics. Springer Verlag, Berlin, 1976.
28. F. Wysotzki, J. Selbig, and W. Kolbe. Concept learning by structured examples - an algebraic approach. In Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981.