## Formal design methods for CAD: proceedings of the IFIP TC5/WG5.2 Workshop on Formal Design Methods for CAD, Tallinn, Estonia, 16-19 June 194Formal design methods provide the basis for the non-graphical use of computer-aided design. This volume represents the cutting edge of international research in the area, where artificial intelligence and cognitive science paradigms are providing a renewed impetus for exploration and development. The sixteen chapters are grouped into five parts: formal representations in design; shape grammars in design; design grammars; formalised design processes; and exploration in design. The volume will provide a valuable source of information for all those connected with this field. |

### From inside the book

Results 1-3 of 36

Page 91

^attribute is an alphabet of

E/a6e/ = ^attribute x (Rvalue U ^) »s the set of

function from nodes to sets of

...

^attribute is an alphabet of

**label**attributes; Tivaiue is an alphabet of**label**values;E/a6e/ = ^attribute x (Rvalue U ^) »s the set of

**labels**; 3. A : K —¥ 2s,abe' is afunction from nodes to sets of

**labels**;**Labels**provide a mechanism for associating...

Page 93

Graph Notation Relational Notation Nodes Arcs Geometry

k2) € Pa j(v) = c (a,v) E X(k) <t — s t(k) a(fci,fc2) v_coord(i;, c)

) Determining the type of topological elements may be represented as a relation ...

Graph Notation Relational Notation Nodes Arcs Geometry

**Labels**State keKt (h,k2) € Pa j(v) = c (a,v) E X(k) <t — s t(k) a(fci,fc2) v_coord(i;, c)

**label**(fc, a, v) state(s) Determining the type of topological elements may be represented as a relation ...

Page 98

It will consider any solid labeled with a "name, room"

a "mark, front"

from the solid and a "name, parlor"

It will consider any solid labeled with a "name, room"

**label**that has a vertex witha "mark, front"

**label**. When the rule is applied, the "name, room"**label**is removedfrom the solid and a "name, parlor"

**label**is added. The color of the solid is then ...### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A tutorial introduction to grammatical programming | 73 |

Geometric design with boundary solid grammars | 85 |

vi | 89 |

Copyright | |

14 other sections not shown

### Common terms and phrases

abduction abstraction algorithm application Artificial Intelligence aspects attribute models b-graph behaviour boundary solid grammar Cagan Carnegie Mellon University complex components computational computer-aided design concepts configuration constraint network context context-free context-free grammars defined definition derived describe description formalisms design description design knowledge design problems design process design space descriptions discussion domain e(corridor elements emergence Engineering Design entities Environment and Planning Euler operations evaluation example exploration external finite set formal methods formal representations formalisation function Galileo4 genetic algorithms geometric Gero graph gripping GSMs Heisserman IFIP ill-structured initial instantiated knapsack problem label language logic nodes objects operations optimization parameters physical principles post interpretation prototypes relations represent rewrite rule schema semantics shape annealing shape grammars shape rules simulated annealing solution principles solving specification Stiny structure symbols syntax synthesis theory tion tool topology truss Tyugu University of Sydney variables vocabulary workpiece YMIR