## 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 17

Page 92

DEFINITION 3.4. A

a tuple B = (K, (/9a)aeE0rc,7, \°)> where 1. {K, (Po)o6Ear<;>7) ^) 85 a labeled

boundary graph; 2. S = S intermediate U {start, done} is a finite set of states; and

3.

DEFINITION 3.4. A

**b**-**graph**over the alphabet = Enode U Earc US3U Zlabd US isa tuple B = (K, (/9a)aeE0rc,7, \°)> where 1. {K, (Po)o6Ear<;>7) ^) 85 a labeled

boundary graph; 2. S = S intermediate U {start, done} is a finite set of states; and

3.

Page 96

The current state of the

to modifying a to a' such that a' = s. Primitive operations derive one

another according to the following definition: DEFINITION 5.1. A

The current state of the

**b**-**graph**is modified with set_state(s). which is equivalentto modifying a to a' such that a' = s. Primitive operations derive one

**b**-**graph**fromanother according to the following definition: DEFINITION 5.1. A

**b**-**graph**b' € is ...Page 101

Solid rules derive one

DEFINITION 6.2. A

solid rule TZ (abbreviated b =» b') iff n 1. the goal an is satisfiable with respect to

...

Solid rules derive one

**b**-**graph**from another according to the following definition:DEFINITION 6.2. A

**b**-**graph**b' € &(E*) is directly derivable from another b e by asolid rule TZ (abbreviated b =» b') iff n 1. the goal an is satisfiable with respect to

...

### 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