In section 4.1 of the MRS paper it says:
Definition 4 (Scope-resolved MRS structure) A scope-resolved MRS structure is an MRS structure that satisfies the following conditions:
- The MRS structure forms a tree of EP conjunctions, where dominance is determined by the outscopes ordering on EP conjunctions (i.e., a connected graph, with a single root that dominates every other node, and no nodes having more than one parent).
- The top handle and all handle arguments (holes) are identified with an EP label.
- All constraints are satisfied. With respect to outscopes constraints, for instance, if there is a constraint in C which specifies that E outscopes E′ then the outscopes order between the EP conjunctions in R must be such that E outscopes E′.7
So, scope-resolved means all the holes are filled and no qeq’s are violated. But you can still have logical variables that are unbound as I learned here.
Definition 5 tantalizingly talks about the issue without giving a term for it that I can find:
Definition 5 (Well-formed MRS structure) A well-formed MRS structure is an MRS structure that link-subsumes one or more scope-resolved MRSs.
…Thus a scope-resolved MRS without unbound variables will correspond to a closed sentence (a statement) in predicate calculus.
So, what is the proper term for a scope-resolved MRS without unbound variables?
It is more than “well-formed” because it is “scope-resolved”
It is more than “scope-resolved” because it has all the scopes set up such that there are no unbound variables.
Therefore it is…what?