# Re: Large class of problems: constrain a bunch of pieces to fo

• From: Michael Kay <mike@saxonica.com>
• To: "Costello, Roger L." <costello@mitre.org>
• Date: Mon, 20 Feb 2017 17:20:28 +0000

 On 20 Feb 2017, at 15:17, Costello, Roger L. wrote: Hi Folks,   There are a large class of problems that may be characterized this way: Given a bunch of pieces, constrain them so they form a single, connected chain.   The following is a beautiful example from this class of problems.   Problem: Constrain the segments in an aircraft’s route so that they form a single, connected chain.   Explanation: An aircraft flies a route. A route consists of segments. A route has a starting fix and an ending fix. A “fix” is a position. Each segment also has a starting fix and an ending fix. One segment’s starting fix must match the route’s starting fix. One segment’s ending fix must match the route’s ending fix. For the other segments, they must be connected: the ending fix of one segment must be the starting fix of another segment.     Example: Here is a trivial route with just one segment:                                                                                                      Here is a route with three segments. Notice the segments are connected:                 BOS -> MARSHFIELD -> FITCHBURG -> JFK   Declarative description of the connected-segments constraint:   Every segment in a route must satisfy these three constraints: 1.       The segment is the route’s first segment, or the segment follows another segment. 2.       The segment is the route’s last segment, or the segment precedes another segment. 3.       The segment does not follow the route and the segment does not precede the route.   Here is a more detailed description:   For every segment s in route r: 1.       The starting fix of s matches the starting fix of r, or there is a segment s2 whose ending fix matches the starting fix of s. 2.       The ending fix of s matches the ending fix of r, or there is a segment s2 whose starting fix matches the ending fix of s. 3.       The starting fix of s does not match the ending fix of r and the ending fix of s does not match the starting fix of r.I think those conditions are satisfied byr.start = Ar.end = Cs1.start = As1.end = Bs2.start = Bs2.end = Cs3.start = As3.end = Cand I don't think you had that in mind as a valid route (a "single connected chain"). Perhaps your "or" in rules (1) and (2) should be an "exclusive or".I don't know whether you consider something like A -> B -> C -> B -> D as a valid route. I don't know whether any planes fly such routes but I've certainly been on country bus journeys that followed that pattern. If such routes are legal you may need to revise your rules.   Schematron implementation of the connected-segments constraint:                      The segments in the route must be connected.           That is so neat. It is a beautiful, declarative expression of the constraints on the segments in a route.   Beauty is in the eye of the beholder, but to me, it would be much more elegant to model a flight route using a list of points rather than a list of segments, in which case no additional constraints are necessary:  LHR  GLA  BOS  LAXMichael KaySaxonica

[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]

### PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
 RSS 2.0 Atom 0.3 Stylus Studio has published XML-DEV in RSS and ATOM formats, enabling users to easily subcribe to the list from their preferred news reader application.