A complete subsumption algorithm

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

Volumn 2829, Issue , 2003, Pages 1-13

  Ferilli, Stefano ^a   Di Mauro, Nicola ^a   Basile, Teresa M A ^a   Esposito, Floriana ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; ALGORITHMS; COMPUTATIONAL METHODS; LEARNING SYSTEMS; LOGIC PROGRAMMING; PROCESS CONTROL; SUBSTITUTION REACTIONS;

DEDUCTION SYSTEMS; FIRST ORDER LOGIC; REAL ENVIRONMENTS;

LEARNING SYSTEMS; ARTIFICIAL INTELLIGENCE;

DEDUCTION SYSTEMS; LOGIC PROOF PROCEDURE; SUBSUMPTION ALGORITHM; TIME/SPACE REQUIREMENTS;

EID: 7444231478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39853-0_1     Document Type: Conference Paper

References (14)

1. [1] C. L. Chang and R.C.T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
2. [2] N. Eisinger. Subsumption and connection graphs. In J.H. Siekmann, editor, GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, January 1981, pages 188–198. Springer, Berlin, Heidelberg, 1981.
3. [3] S. Ferilli, N. Fanizzi, N. Di Mauro, and T.M.A. Basile. Efficient θ-subsumption under Object Identity. In Atti del Workshop AI*IA su Apprendimento Automatico, Siena-Italy, 2002.
4. [4] A. Giordana, M. Botta, and L. Saitta. An experimental study of phase transitions in matching. In Dean Thomas, editor, Proceedings of IJCAI-99 (Vol2), pages 1198–1203, S. F., July 31–August 6 1999. Morgan Kaufmann Publishers.
5. [5] G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery, 32(2):280–295, 1985.
6. [6] N. Helft. Inductive generalization: A logical framework. In I. Bratko and N. Lavrač, editors, Progress in Machine Learning, pages 149–157, Wilmslow, UK, 1987. Sigma Press.
7. [7] J.-U. Kietz and M. Lübbe. An efficient subsumption algorithm for inductive logic programming. In W. Cohen and H. Hirsh, editors, Proceedings of ICML-94, pages 130–138, 1994.
8. [8] J.W. Lloyd. Foundations of Logic Programming. Springer, Berlin, New York, 2 edition, 1987.
9. [9] J. Maloberti and M. Sebag. θ-subsumption in a constraint satisfaction perspective. In Céline Rouveirol and Michèle Sebag, editors, Proceedings of ILP 2001, volume 2157 of Lecture Notes in Artificial Intelligence, pages 164–178. Springer, September 2001.
10. [10] J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–49, January 1965.
11. [11] T. Scheffer, R. Herbrich, and F. Wysotzki. Efficient θ-subsumption based on graph algorithms. In Stephen Muggleton, editor, Proceedings of ILP-96, volume 1314 of LNAI, pages 212–228. Springer, August 26–28 1997.
12. [12] M. Schmidt-Schauss. Implication of clauses is undecidable. Theoretical Computer Science, 59:287–296, 1988.
13. [13] Ashwin Srinivasan, Stephen Muggleton, Michael J. E. Sternberg, and Ross D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1-2):277–299, 1996.
14. [14] R. B. Stillman. The concept of weak substitution in theorem-proving. Journal of ACM, 20(4):648–667, October 1973.