Declarative Programming with Temporal Constraints,  in the Language <span style="font-family:monospace">CG</span>

<div>The temporal graph <svg height="12.7059pt" id="M49" style="vertical-align:-3.31357pt" version="1.1" viewbox="-0.0498162 -9.39233 18.7918 12.7059" width="18.7918pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0136,0,0,-0.0136,0,0)"><path d="M714 664L702 678C677 661 651 638 627 626C588 607 568 607 547 607C524 607 496 619 461 638C391 673 360 687 319 687C215 687 144 611 144 536S191 410 271 410C339 410 379 452 412 517L394 526C361 473 326 440 273 440C209 440 185 482 185 534S237 635 301 635C329 635 366 621 403 601C456 572 487 557 527 557C532 557 540 557 547 558C427 454 384 369 336 292C189 231 53 149 53 45C53 9 77 -15 110 -15C127 -15 146 -11 166 -4C260 31 369 152 443 298L550 339C495 254 446 155 446 77C446 21 481 -12 533 -12C594 -12 659 42 735 134L714 147C642 63 586 18 547 18C528 18 513 32 513 53C513 111 593 253 687 387C835 446 991 527 991 637C991 673 965 687 934 687C874 687 752 597 612 422L579 379C540 364 503 356 464 340C536 484 606 581 696 650L714 664ZM958 635C958 559 851 493 720 434C805 554 896 657 934 657C950 657 958 650 958 635ZM307 241C253 147 171 15 110 15C98 18 86 24 86 44C86 120 179 182 307 241Z" id="g198-9"></path><glyph.data ascent="687" descent="-226" horiz-adv-x="997" vert-adv-y="997"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,13.508,3.264)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg> describing John and Alice’s evolution.</div>

The Scientific World Journal

fig2

Figure 2

Figure 2: Declarative Programming with Temporal Constraints,  in the Language <span style="font-family:monospace">CG</span> 

The Scientific World Journal

Declarative Programming with Temporal Constraints, in the Language CG

Figure 2