Research Article
An Improved Abstract State Machine Based Choreography Specification and Execution Algorithm for Semantic Web Services
Table 1
Summary of Flora-2 syntax [
45] used in the implementation.
| | Flora-2 syntax | Meaning |
| | concept[|attribute => type|]. | Defines a concept, its attributes, and their types | | object[attribute -> value]. | Specifies the value of an instance attribute | | subconcept::concept. | Defines inheritance between two concepts | | object:concept. | Instance declaration | | Reifies any kind of object in Flora-2 | | ~ | Metaunification operator | | ∖object | Top-most object in Flora-2 | | ∖if…∖then…∖else | If-then-else formula | | Predicate(parameters) | A tabled predicate | | Predicate(parameters) | A nontabled predicate | | ?variable | Logic variable | | ?_ | Don’t care logic variable | | ?_name | Don’t care identifiable logic variable | | ,(∖and) ;(∖or) ∖+ | Logical AND, Logical OR, Negation as Failure | | L :- R | Clause definition | | ! | The cut operator | | ∖prolog | Module containing Prolog predefined predicates | | ∖btp | Module containing embedded base-types or predicates | | setof?X ∣ any formula containing variable ?X} | Generates the list of all X’s such that the formula where it occurs as a free variable is true | | //comment // | Comments |
|
|
