Efficient Operations in Feature Terms Using Constraint Programming
- 769 Downloads
Feature Terms are a generalization of first-order terms that have been introduced in theoretical computer science in order to formalize object-oriented capabilities of declarative languages, and which have been recently receiving increased attention for their usefulness in structured machine learning applications. The main obstacle with feature terms (as well as other formal representation languages like Horn clauses or Description Logics) is that the basic operations like subsumption have a very high computational cost. In this paper we model subsumption, antiunification and unification using constraint programming (CP), solving those operations in a more efficient way than using traditional methods.
KeywordsDescription Logic Constraint Programming Constraint Satisfaction Problem Inductive Logic Programming Horn Clause
Unable to display preview. Download preview PDF.
- 1.Aït-Kaci, H.: Description logic vs. order-sorted feature logic. In: DL (2007)Google Scholar
- 2.Aït-Kaci, H., Podelski, A.: Towards a meaning of LIFE. Tech. Rep. 11, Digital Research Laboratory (1992)Google Scholar
- 4.Arcos, J.L.: The NOOS representation language. Ph.D. thesis, Universitat Politècnica de Catalunya (1997)Google Scholar
- 5.Armengol, E., Plaza, E.: Lazy learning for predictive toxicology based on a chemical ontology. In: Artificial Intelligence Methods and Tools for Systems Biology, vol. 5, pp. 1–18 (2005)Google Scholar
- 6.Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)Google Scholar
- 7.Carpenter, B.: The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science, vol. 32. Cambridge University Press (1992)Google Scholar
- 8.Dietterich, T., Domingos, P., Getoor, L., Muggleton, S., Tadepalli, P.: Structured machine learning: the next ten years. Machine Learning, 3–23 (2008)Google Scholar
- 9.Ferilli, S., Fanizzi, N., Di Mauro, N., Basile, T.M.: Efficient theta-subsumption under object identity. In: Workshop AI*IA 2002, pp. 59–68 (2002)Google Scholar
- 10.Hoder, K., Voronkov, A.: Comparing unification algorithms in first-order theorem proving. In: Proc. 32th German conf on Advances in AI, pp. 435–443 (2009)Google Scholar
- 13.Lavrač, N., Džeroski, S.: Inductive Logic Programming. Techniques and Applications. Ellis Horwood (1994)Google Scholar