Exploiting the hierarchical structure of rule-based specifications for decision planning

  • Authors:

  • Artur Boronat;Roberto Bruni;Alberto Lluch Lafuente;Ugo Montanari;Generoso Paolillo

  • Affiliations:

  • Department of Computer Science, University of Leicester, UK;Department of Computer Science, University of Pisa, Italy;IMT Institute for Advanced Studies Lucca, Italy;Department of Computer Science, University of Pisa, Italy;Laboratorio CINI-ITEM Carlo Savy, Naples, Italy

  • Venue:
  • FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries like term and graph rewriting. Realistic problems, however, call for suitable techniques to guarantee scalability. For instance, many domains exhibit a hierarchical structure that can be exploited conveniently. This is particularly evident for composition associations of models. We propose an explicit representation of such structured models and a methodology that exploits it for the description and analysis of model- and rule-based systems. The approach is presented in the framework of rewriting logic and its efficient implementation in the rewrite engine Maude and is illustrated with a case study.