Fast Theta-Subsumption with Constraint Satisfaction Algorithms.

Relational learning and Inductive Logic Programming (ILP) commonly use as covering test the theta-subsumption test defined by Plotkin. Based on a reformulation of theta-subsumption as a binary constraint satisfaction problem, this paper describes a novel theta-subsumption algorithm named Django,1 wh...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Machine learning. 55, 2 (2004).
المؤلف الرئيسي: Maloberti, Jerome
التنسيق: مقال
اللغة:English
الموضوعات: