MELO2011:CFP

From IDMPP

Revision as of 10:36, 15 February 2011

Model-Driven Engineering, Logic and Optimization: friends or foes?

Goals

The main goal of this workshop is to bring together two different communities: the Model-Driven Engineering (MDE) community and the logic programming community, to explore how each community can benefit from the techniques of the other. We refer to the logic programming community in a broad sense (i.e. including Constraint Logic Programming, Answer-Set Programming but also ontology and semantic web aspects).

The widesepread application of MDE in all kinds of domains (e.g. critical sytems, software product lines, embedded systems,...) has triggered the need of new techniques to solve optimization, visualization, verification, configuration,... problems at the model level. Instead of reinventing the wheel, most of these problemes could be solved by reexpressing the modeling problem as a logic programming problem. As an example, verification (satisfiability) of large static models can be addressed by reexpressing the model as a constraint satisfaction problem to be solved by state-of-the-art constraint solvers.

Similarly, logic programming can benefit from the integration of MDE principles. As in any other domain, introduction of MDE would help to raise the abstraction level at which the problem is described (e.g. by providing domain-specific languages that allow non-technical users to specify the problem using a vocabulary closer to the domain), improve the separation of concerns by using different model-based views of the problem at different levels of detail, achieve tool independence (e.g. by following a typical PIMPSM separation where, for instance, at the PIM level we could define tool-independent logic programming metamodels), increase reusability, ... We believe the workshop will attract researchers and practitioners in all the above areas.

Topics

The scope of this workshop involves the three following kind of topics:

• Using MDE in constraint applications,
• Using CLP to solve MDE problems,
• Using CLP to manage SPL problems.

Topics of interest include (but are not limited to):

• Modeling and generation of constraint problems,
• Interoperability between constraint technical spaces,
• Constraint metamodels,
• CIM-PIM-PSM for CLP,
• Domain Specific Languages for CLP,
• SBVR,
• BPMN,
• Satisfaction,
• Model Checking,
• Model Optimization,
• Using CP or OR to compute SPL solutions,
• Using MDE to represent SPL problems and solutions,
• Comparing combination of MDE and CP/OR for SPL.

Participants and Paper Selection

Technical papers describing original solutions, empirical evaluation papers and experience/industrial papers presenting problems or challenges encountered in practice are welcome.

There are three types of papers: position papers (5 pages), short papers (up to 8 pages) and full papers (up to 16 pages). Easychair will be used as submission system.

The program committee will review the submissions (minimum 2 reviews per paper) and select papers according to their relevance and interest for discussions that will take place at the workshop.

Plans for dissemination

Accepted papers will be first published online in the workshop web page. It is planned that the final versions of accepted papers will be published as online proceedings on the CEUR Workshop Proceedings publication service.