Flattening and implication

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

Volumn 1720, Issue , 1999, Pages 157-168

  Hirata, Kouichi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEFINITE CLAUSE;

C (PROGRAMMING LANGUAGE);

EID: 84957072103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46769-6_13     Document Type: Conference Paper

References (15)

1. Angluin, D., Frazier, M. and Pitt, L.: Learning conjunctions of Horn clauses, Machine Learning 9, 147-164, 1992.
2. De Raedt, L. and Džeroski, S.: First-order jk-clausal theories are PAC-learnable, Artificial Intelligence 90, 375-392, 1994.
3. Frazier, M. and Pitt, L.: Learning from entailment: An application to propositional Horn sentences, Proc. 10th International Conference on Machine Learning, 120-127, 1993.
4. Gottlob, G.: Subsumption and implication, Information Processing Letters 24, 109-111, 1987.
5. Hanschke, P. andWürtz, J.: Satisfiability of the smallest binary program, Information Processing Letters 45, 237-241, 1993.
6. Leitsch, A.: Implication algorithms for classes of Horn clauses, Statistik, Informatik und ö konomie, Springer, 172-189, 1988.
7. Leitsch, A.: The resolution calculus, Springer-Verlag, 1997.
8. Marcinkowski, J. and Pacholski, L.: Undecidability of the Horn-clause implication problem, Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, 354-362, 1992.
9. Muggleton, S.: Inverting implication, Proc. 2nd International Workshop on Inductive Logic Programming, ICOT Technical Memorandum TM-1182, 1992.
10. Muggleton, S. (ed.): Inductive logic programming, Academic Press, 1992.
11. Muggleton, S.: Inverse entailment and Progol, New Generation Computing 13, 245-286, 1995.
12. Muggleton, S. and Page Jr., C., D.: Self-saturation of definite clauses, Proc. 4th International Workshop on Inductive Logic Programming, 162-174, 1994.
13. Nienhuys-Cheng, S.-H. and de Wolf, R.: Foundations of inductive logic programming, Lecture Notes in Artificial Intelligence 1228, 1997.
14. Rouveirol, C.: Extensions of inversion of resolution applied to theory completion, in Inductive logic programming, 63-92.
15. Schmidt-Schauss, M.: Implication of clauses is undecidable, Theoretical Computer Science 59, 287-296, 1988.