Towards a Declarative, Constraint-Oriented Semantics with a Generic Evaluation Algorithm for GRL
نویسندگان
چکیده
Goal models described with the Goal-oriented Requirement Language (GRL) are amenable to various kinds of analyses, including quantitative and qualitative propagations of satisfaction values. However, most approaches use bottom-up evaluations involving operational semantics that can only answer what if questions. This paper introduces a new declarative semantics for GRL based on a constraint-oriented interpretation of goal models. This semantics enables constraint solvers to evaluate and optimize goal models in a way that is more generic than bottom-up and top-down propagation techniques, hence enabling other questions to be answered. A prototype that combines the jUCMNav modeling tool and the JaCoP constraint solver to support quantitative evaluations is used to demonstrate the feasibility and potential of this new approach.
منابع مشابه
Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کاملDeclarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming
Debugging tools are a practical need for diagnosing the causes of erroneous computations. Declarative programming paradigms involving complex operational details, such as constraint solving and lazy evaluation, do not fit well to traditional debugging techniques relying on the inspection of low-level computation traces. As a solution to this problem, declarative diagnosis uses Computation Trees...
متن کاملNatural Semantics for Imperative and Object-Oriented Programming Languages
We present a declarative speciication method based on natural semantics which is suitable for the deenition of the static and dynamic semantics of imperative and object-oriented programming languages. We show how the semantic analysis can be generated automatically by creating , for each program under consideration, a constraint problem whose solution is also a valid attribution. In contrast to...
متن کاملUsing Constraint Propagation and Domain Reduction for the Generation Phase in Declarative Modeling
This paper presents an oriented object constraint solver based on constraint propagation and domain reduction for the generation phase in declarative modeling. The solver supports generic constraints and heterogeneous parameters via generic domains. This ensures adaptability and efficiency of the resolution process in complex cases. As an application, a declarative system for 3D-environments pl...
متن کاملA Rewrite Approach for Constraint Logic Programming
Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the uniication mechanism used in Prolog, by a more general operation called constraint satisfaction. This yields a more eecient evaluation process due to the use of appropriate algorithms designed speciically for a given constraint domain. On the other hand, it is known that pure logic programs can be rep...
متن کامل