Book chapter
Efficient Operations in Feature Terms Using Constraint Programming
Inductive Logic Programming, pp 270-285
2012
Abstract
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.
Metrics
11 Record Views
3 citations in Scopus
Details
- Title
- Efficient Operations in Feature Terms Using Constraint Programming
- Creators
- Santiago Ontañón - Artificial Intelligence Research InstitutePedro Meseguer - Artificial Intelligence Research Institute
- Publication Details
- Inductive Logic Programming, pp 270-285
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Resource Type
- Book chapter
- Language
- English
- Academic Unit
- Computer Science (Computing)
- Scopus ID
- 2-s2.0-84864832636
- Other Identifier
- 991021869111404721