Model transformation by example using inductive logic programming.

Saved in:
Bibliographic Details
Title: Model transformation by example using inductive logic programming.
Authors: Balogh, Zoltán1,2 zoltan.balogh@optxware.hu, Varró, Dániel1,2 varro@mit.bme.hu
Source: Software & Systems Modeling. Jul2009, Vol. 8 Issue 3, p347-364. 18p. 11 Diagrams.
Subjects: Computer programming, Parallel logic programming, Programming languages, Computer software, Model-integrated computing, Horn clauses
Abstract: Model transformation by example is a novel approach in model-driven software engineering to derive model transformation rules from an initial prototypical set of interrelated source and target models, which describe critical cases of the model transformation problem in a purely declarative way. In the current paper, we automate this approach using inductive logic programming (Muggleton and Raedt in J Logic Program 19-20:629–679, 1994) which aims at the inductive construction of first-order clausal theories from examples and background knowledge. [ABSTRACT FROM AUTHOR]
Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Model transformation by example is a novel approach in model-driven software engineering to derive model transformation rules from an initial prototypical set of interrelated source and target models, which describe critical cases of the model transformation problem in a purely declarative way. In the current paper, we automate this approach using inductive logic programming (Muggleton and Raedt in J Logic Program 19-20:629–679, 1994) which aims at the inductive construction of first-order clausal theories from examples and background knowledge. [ABSTRACT FROM AUTHOR]
ISSN:16191366
DOI:10.1007/s10270-008-0092-1